The recurrence time equation of finding the height of the binary tree is O a. T(n) = O(n) 0 b. Tn)=f(n/2) + n O c. T(n)= T(n/2) + C 0 d. T(n) = 2T(n/2) + C The time complexity of BF convex hull problem is O a. O(n) O b. O(n) O c. on) d. On log n) The recurrence equation is T(n)= 2T(n/2) - n then the master theorem case is Select one: a. case B O b. Not applicable I. c. case 1 d. case 2 Suppose we are sorting an array of eight integers. After four iterations the array elements are ordered as shown here: 24 5 7 8 1 3 6. We use Select one: o a. Insertion sort b. Selection sort O c. None of these O d. Bubble sort Let the permutation is 3 -2 -1 4- then the next permutation is O a.--2 3--1--4 O b. -2 3- -1 4- O C.3--2-4 1- O d. - 2 3 - 1 4