C++ DATA STRUTCTURE

Question 4 10 pts Unfortunately, many of the recursive solutions in this chapter are so inefficient that you should not use them. Notable exceptions are (check all that apply): Choosing k Out of n Things Finding the kth Smallest Value of an Array The Fibonacci Sequence Towers of Hanoi Finding the Largest Value in an Array Binary Searches