1. Describe an algorithm that takes a list of n integers a1, a2, , an and finds the average of the largest and smallest integers in the list.

2. Use the bubble sort algorithm discussed in class to sort 20, 64, 77, 50, 42, and 22 showing the lists obtained at each step.

3.Use the insertion sort algorithm discussed in class to sort 20, 64, 77, 50, 42, and 22 showing the lists obtained at each step.

4. Show how the binary search algorithm discussed in class searches for 42 in the sorted list below: 10 11 13 15 18 27 29 31 36 42 50 56 70 73 82 96