11. Using the Selection Sort algorithm on p 169 in your textbook, simulate the execution of the algorithm on the following list L; write the list after every exchange. L: 9, 2, 4, 8, 6 ORITHM BINARYSEARCH BinarySearch(list L; positive integer i; positive integer j; itemtype x) //searches sorted list L from L[i] to L[] for item x if i >; then write("not found") else find the index k midway between i andj if x = midpoint item L[k] then write("found") else if x