Please answer from 2 to 7.

Describe (write) an algorithm that takes a list of n integers a1, a2,. ., an and finds the number of integers each greater than five in the list. Find the "best" big-O notation to describe the complexity of the algorithm. 1. 2. Describe (write) an algorithm that takes a list of n integers (n -1) and finds the average of the largest and smallest integers in the list. Find the "best" big-O notation to describe the complexity of the algorithm. Write the binary search algorithm and describe in words how it works Prove or disprove that the greedy algorithm for making change always uses the fewest coins 3. 4. possible when the denominations available are 1-cent coins, 8-cent coins, and 20-cent coins. 5. Find the big-O of the following a. 3n2+8n+7 6n 4n5-4 7n2-3 b. 6. Prove that 5x4 + 2x3-1 is (x4) 7. Prove that x 7x2 is S2(x3) 8. Write the truth table for the proposition _{ r q) v (p ^-r). 9. Determine whether p) and p (q Ar) are equivalent 10. Determine whether this proposition is a tautology: ((p-q)p)