Problem 2: 22 pts) Let A[1...n be an array with n items. A' is array A right-flipped at k with 1k Suppose that A originally contains n distinct numbers sorted in increasing order, i.e., A[1] 0. You can then quote the "fact" from class that Equa- tion (4) implies T(n) = O(logn). If you can not show that T(n) satisfies Equation (4), then you must prove from first principles that whatever re- currence relation you derived implies T(n) = O(log n) for all values of n. +c