Write pseudocode for a divide$-$and$-$conquer algorithm for finding the position of the largest element in

an array of n numbers.

Order the following pseudocode to complete the algorithm.

Algorithm MaxIndex$($A$,$ I, r$)$

$//$Input: A portion of array $A[0..n-1]$ between indices I and $r(Ir)$

$//$Output: The index of the largest element in A$[$I$..$r$]$

$1$

$2,$vdots temp$-$r $,$ floor of $\frac{I+r}{2}+1,r$

$3$ :: return temp$-$I

$4,$ :: else return temp$-$r$\}$

$5,$vdots

$6$ :: if I$=$r return I

$7,$ :: temp$-$I $,$ floor of $\frac{I+r}{2}$

$8$