QUESTION 33 Using the following array 9 10 8 6 7 5 11 List the array contents (separated by spaces) after three iterations of the outer loop of bubble sort (ascending). The outer loop should start at Index 0. At least three elements should be sorted QUESTION 34 Using the following array: 9 10 4 8 6 2 5 11 List the array contents (separated by spaces) after three iterations of the outer loop of selection sort (ascendingi, selecting the min element. Al least three elements should be sorted. QUESTION 35 Using the following array: 9 10 4 8 6 7 5 11 List the array contents (separated by spaces) after four iterations of the outer loop of insertion sort. At least five elements should be sorted as the outer loop starts at index 1. QUESTION 36 Using the following array: 9 10 8 7 6 5 4 11 List the Left subarray contents (separated by spaces) after the two recursive calls in merge sort, but before the call to merge QUESTION 37 Using the following array: 9 10 4 8 6 7 5 11 List the Right subarray contents (separated by spaces) after the two recursive calls in merge sort, but before the call to merge. QUESTION 38 Using the following array, which is different than the arrays in the previous problems 8 10 4 6 7 5 9 11 List the array contents (separated by spaces) after the first call to partition, but before the two recursive calls in quick sort. Use the method shown in class the slides, choosing the index as the plot. Do not forget to swap the pivot at the end of partition