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 an array of n given elements in sorted order. Thetan^2) An algorithm that returns the minimal element from an array with n elements. Thetan) An algorithm that returns any pair of 2 elements from an array with n elements. Theta(n!) An algorithm that returns an arbitrary array of n numbers where each number is from the range [1...n]. Theta(n) Choose... Theta(n!) Theta(sqrt(n)) Theta(n^4) Theta(n^3) Thetan) Theta(3^n) Theta(log n) Theta(n^n) Theta(n^2) Theta(2^n) Theta(n)