1. Given the following list:

8 6 1 5 4 9 3 7

trace the execution for merge sort.

2.Given the resulting sorted list, trace the execution for a binary search, searching for the number 102.

4 9 12 23 45 67 89 92 102 123

Note: Please see the algorithm of binary search in the text, ppt or in the example questions.

3.Given the following list:

8 6 1 5 4 9 3 7

Write out the state of the list while being sorted using the selection sort algorithm.

4.Given the following list:

8 6 1 5 4 9 3 7

Write out the state of the list while being sorted using the insertion sort algorithm: