Java programming help needed. Please provide an explanation to gain a better understanding of each answer.

1. Selection sort the following (show the state of the list on each iteration): 5 9 7 3 6 1 4 2 8
2. Insertion sort the following (show the state of the list on each iteration): 5 9 7 3 6 1 4 2 8
3. In a list of 100 items, what is the WORST case for linear search? The BEST case? The AVERAGE case?
4. In a list of 100 items, what is the WORST case for binary search? The BEST case? The AVERAGE case?
5. What is 'Order of n' O(n)? What can this be used for?