6. Given the following array: a. Use Selection Sort algorithm to determine what the array would look like after each pass of the algorithm. How many passes are required to completely sort the array? Which element is already sorted after each pass? b. Use Bubble Sort algorithm to determine what the array would look like after each pass of the algorithm. How many passes are required to completely sort the array? Which element is already sorted after each pass? c. Use Insertion Sort algorithm to determine what the array would look like after each pass of the algorithm. How many passes are required to completely sort the array? Which element is already sorted after each pass? d. Use Quick Sort algorithm to determine what the array would look like after each call to the algorithm. Which element is already sorted after each pass? 76 23 4 98 12 13 77 45 120 -4 64 0