Over an integer array A[0...n-1] of size n, answer the following questions. (a) What is the complexity of searching for a key k over A? Assume that ke A, and answer for the average case. (b) What is the average case complexity of sorting A with mergesort? (c) Suppose A were in sorted order. What would be the cost of searching for a key k with binary search? Assume that k A, and answer for the average case. (d) Let K[0...m-1] be a list of search keys. For each 0