1. (3 points) - Describe an algorithm using pseudocode as discussed in class that takes a list of n integers a1, a2, ..., an, and returns the number of times that a single digit 2 (as opposed to 12, 22, etc) occurs in the list. Be sure to initialize the variables. Hint: the initial value of the counter should be 0. 2. (4 points) - The bubble sort algorithm discussed in class is used to sort the following sequence of integers: 17 2 12 15 6 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 25 in the sorted list below: 4 6 8 9 20 23 26 34 42 48