The following function finds the position of the highest number in the Array S. int max_position(int low, int high) { int position: if (low = = high) Return low Else { positions = max_position(low + 1, high): If (S[low] > S[position]) position = low: return position: } } A. Determine the recurrence relation for this function a. The basic operation is the red comparison in the ‘else’ B. Find the hypothesis: C. Prove the hypothecs is correct by induction. (show all steps)