Have to make algorithm in this format.

Use Induction to design an algorithm to find the position (index) of the largest number in a sequence of n numbers. Use a recursive algorithm to express your solution precisely. a reverseR(A, F, I) { // this is to reverse the numbers in A starting from index f and ending at index / iff{ swap A[f] with A[/] reverseR(A, f+1, 1-1) } else return A } }