Implement the following two functions in c$++$ that operate over arrays of int

$($assume the values in the array are unique$)$:

A$.$ indexOfMax $($array$,$size$)$: This function should return the index of the

largest element of the array $($assume that the size is greater than $0).$

B$.$ selectionSort$($array$,$size$)$: This function should sort the elements of

the array using the following algorithm: find the largest element and move it

into the last position, then find the next largest element and move it into the

second to last position, and so on$,$ until the entire array is sorted.

$$Do not use any other algorithm to sort the list.

$$This function should call the indexOfMax function from part A$.$