1. (3 points) - describe using pseudocode as described in class an algorithm that takes a list of n integers a1, a2, …, an, and returns the sum of the largest and smallest. be sure to initialize the variables. 2. (4 points) – the bubble sort algorithm discussed in class is used to sort the following sequence of integers: 2 16 38 9 4 14 • how many passes must the algorithm perform to guarantee the entire sequence is sorted? • what is the list obtained after the first pass? • what is the list obtained after the third pass? • what is the list obtained after the final pass? 3. (3 points) - show how the binary search algorithm discussed in class searches for 24 in the sorted list below: 2 4 6 7 10 31 32 34 35 37 39 40