Exercise I (50 points) Given the following array of integers Arr. if the array Arr is to be sorted in increasing order, show how it would look like after the second iteration using the following sorting algorithm (One iteration for the Bubble, Selection, and Insertion sort means one round where one element is moved to its correct place, and one iteration for the Quick sort means selecting one pivot and sorting all the elements around the pivot, and putting the pilot in the right place). For the Quick sort alogirithm just show how the array would look like after the first iteration: Arr- 78 12 21 27 98 14. 6 a. Bubble Sort 12 21 27 14. 6 78 98 b. Selection Sort c. Insertion Sort d. Quick Sort (assuming that the element in the middle of the array is selected as the pivot