1.Describe an algorithm using pseudocode as discussed in class that takes a list of n integers a1, a2, ..., an, and returns a count of the number of even integers. You can assume that we have a function called IsEven() that takes a value as an argument and returns true if the value is even.Be sure to initialize the variables.

2. The bubble sort algorithm discussed in class is used to sort the following sequence of integers: 13 26 7 31 13 28How 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. Show how the binary search algorithm discussed in class searches for 25 in the sorted listbelow: 2 3 4 9 18 20 24 33 34 45