Please show work, thank you!

4- Given the following array: (2 pts) 124, 3, 27, 13, 34, 2,50, 12) 1. If the array is sorted using selection sort, what will the array look like after the third pass of the algorithm (i.e., after the third time that the algorithm performs a pass or partial pass through the elements of the array)? 2. If the array is sorted using insertion sort, on how many iterations of the outer loop will the inner while loop be skipped