Question 6 (2 points) Sort the following list using the bubble sort algorithm as discussed in our textbook. Show the list after each iteration of the outer for loop. 46, 48, 16, 25,83,98, 8, 70,5, 62 Question 7 (2 points) Recall the insertion sort algorithm as discussed in this chapter of our textbook. Assume the following list of keys: 30, 20, 35, 27,96, 82, 56, 60, 48, 75,5,80 Exactly how many key comparisons are executed to sort this list using insertion sort? Show the list after each iteration of the outer for loop of your insertion sort