In this exercise we consider algorithms that return a specific set of possible values. For each type of algorithm select the minimum number of leaves the decision-tree of a correct algorithm can have. (In other words, what is the number of distinct values that can be returned by the algorithm?) An algorithm that returns any pair of 2 elements from an array with n elements. Choose... An algorithm that returns an array of n given elements in sorted order. Choose... An algorithm that returns an arbitrary set of n numbers where each number is from the range (1...n]. Choose... An algorithm that returns the minimal element from an array with n elements. Choose... Choose... Theta(n^4) Theta(n^n) Theta(2^n) Theta(n) Theta(3^n) Theta(n^2) Theta(n^3) Theta(n!) Theta(log n) Theta(sqrt(n))