Consider another algorithm for solving the same problem as the one in Homework 2 (problem array into two halves (call Min2 (A[0.n 1) ID, which recursively divides an ALGORITHM Min2 (A[left.right) if lefi right return Alleft] else templ- Min2 (Alleft. Lleft+right)/2l temp2 Min2 (AlL(left+right)2]+1.right) if templ S temp2 return templ else return temp2 ) [10 points] Set up a recurrence relation for the algorithm's basic operation count and solve it