5-7b. For each of the following problems: design a nave algorithm that solves the problem; describe your algorithm with clear pseudocode; and prove the time efficiency class of your algorithm

5-7c:

list reversal (b) input: a list L of n elements output: a list containing the elements of L but in reversed order reverse sorting problem c) input: a list U of n comparable elements output: a list S containing the elements of U in non-increasing order Hint: Base your algorithm on selection sort, and make as few changes as possible