structures. 28. Describe three uses of a tree structure as a way of organizing information. 20 Comentafach Turit anh 40. For each of the following problems briefle escribe an algorithm that solves the problem, identify a good "operation fundarintal 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. 44. The method Sum listed below returns the sum of the integers between 1 and n. What is its order of growth? Create a new method that performs the same function that is a lower order of growth. public int Sum (int n) 1/ Precondition: n is > 0 int total = 0; for (int i = 1; i