3. What does the following recursive algorithm compute? Set up a recurrence relation for the running time of the algorithm and solve it using backward substitution. SAMSUN(al, a+1,..., aj) input : a sequence of integers if i = j return a else mid < (i+j)/2 temp1 SAMSUN(ai, ..., amid) temp2 SAMSUN(amida... ,aj) if temp1 s temp2 return temp1 else return temp2