Consider the following algorithm ALGORITHM FindA[p..r]) if p ==r return A[p] else temp1 = Find(A[[p + r)/2] +1..r]) if temp 1 lessthanorequalto temp2 return temp1 else return temp2 a. What does this algorithm compute? b. Set up a recurrence relation for the algorithm's basic operation count and solve it. You may assume that the array A has 2elements