(a) With respect to the input n, what is the worst-case time complexity of the following algorithm? n); 2+1) { (i for (j = i; j > 1; j = ceil(j/2)) { for 1; i In the above, exp (2, n) denotes 2n and ceil (j/2) denotes 1. distinct integers Input: Array a of size n. Assume that array has distinct elements (b) Consider the following method that computes the median of an array of consisting of