5. Suppose that a list contains integers that are in order of largest to smallest and an integer can appear repeatedly in this list. 1) Devise an algorithm that locates all occurrences of an integer x in the list. 2) Estimate the number of comparisons used. You must show/explain your work. Simply stating the answers will result in 0 points awarded. (10 points each, 20 points in total.)