The following algorithm returns the position of the largest element in the array S. Write a recurrence equation for the number of comparisons tn needed to find the largest element. Use induction to show that the equation has the solution tn = n 1.

The top-level call is

max position (1, n).

index mar-position (index low, index high) index position; if (low_ hig h else return low position = mar-position(low + 1, high); if (Slow] > SIposition]) position= low; return position