1. For the following array x, show x after each of the first two passes of simple selec tion sort to arrange the elements in ascending order: 2. 3. i 1 30 i 2 3 4 + 50 70 10 40 60 a. For the following array x, show x after each of the first two passes of bubble sort to arrange the elements in descending order: i 1 2 3 60 50 70 10 5 1 20 6 4 5 6 40 20 b. How many passes will bubble sort make altogether? c. In what situations will bubble sort make the most interchanges? a. Linear insertion sort has just correctly positioned x[3] in the following array x: 2 3 4 5 6 40 60 30 10 50 Show x after each of x[4] and x[5] is correctly positioned. b. In what situation will linear insertion sort make the fewest interchanges?