Analyze 3. the running time equation and the O-notation that results from your analysis. the following abstract program strategy for selection sorting . Give both void SelectionSort(SortingArray A, int n) To sort A[0:n-1]/ / if the array A[O:n-1] has more than one item *7 (Exchange A[p] and A[n-1] to make A[n-1] the smallest item in A[0:n-1]) 1){ Find the position, p, of the smallest item in A[O:n-2]) f (n > (Sort the rest of the array A[O:n-2] by calling SelectionSort(A,n-1)