case number of guesses required by each of there approaches if the highest possible number is (a) 10,(b) 1,000, (c) 1,000,000, and 2,000,000,000. 40. For each of the following problems briefl'escribe an algorithm that solves the problem, identify a good "operation fundar intal to the algorithm" that could be used to calculate the algorithm's efficiency, succinctly describe the size of the prob- lem, and state the number of times the fundamental operation occurs as a function of the problem size in the best case and worst case. For example, if the problem was "guess the secret number in the Hi-Lo Guessing Game" your answer might be "start at 1 as my first guess and keep adding one to my guess until I guess the number; announce my guess; the highest possible number-call it N; best case 1 time, worst case N times". Game: Hi-Lo Sequential Search and Hi-Lo Binary Search. What is the best and worst case number of guesses required by each of there approaches if the highest possible number is (a) 10. (b) 1,000. (C) 1,000,000, and 2,000,000,000. 40. For each of the following problems briefly Tescribe an algorithm that solves the problem, identify a good "operation fundar intal to the algorithm" that could be used to calculate the algorithm's efficiency, succinctly describe the size of the prob- lem, and state the number of times the fundamental operation occurs as a function of the problem size in the best case and worst case. For example, if the problem was "guess the secret number in the Hi-Lo Guessing Game" your answer might be "start at 1 as my first guess and keep adding one to my guess until I guess the number; announce my guess; the highest possible number-call it N; best case 1 time, worst case N times". a. Finding The Art of Computer Programming on a shelf of unsorted books. b. Sorting an array of integers. c. Finding the cheapest pair of shoes in a shoe catalog. d. Figuring out how much money is in a piggy bank. e. Computing N! for a given N. f. Computing the sum of the numbers 1 to N, for a given N. g. Multiplying two N X N matrices