From an array of size n , we need to find the k bigger elements. What is the data structure we should use to find k bigger element in best asymptotic complexity?
1.A max heap of size n.
2. A max heap of size k.
3. A min heap of size n.
4.A min heap of size k.