1. Sort the following list using selection sort as discussed in this chapter. Show the list after each iteration of the outer for loop. 26,45,17,65,33,55,12,18 2. Assume the following list of keys: 28,18,21,10,25,30,12,71,32,58,15 This list is to be sorted using insertion sort as described in this chapter for array-based lists. Show the resulting list after six passes of the sorting phase - that is, after six iterations of the for loop