4. 5-7(c) reverse sorting problem design a naive algorithm that solves the problem; describe your algorithm with clear pseudocode; and prove the time efficiency class of your algorithm. input: a list U of n comparable elements output: a list S containing the elements of U in non-increasing order 5. 5-10 Design a sorting algorithm whose time complexity is as follows: (a) when the input happens to be already non-decreasing, the algorithm takes only O(n) time; (b) likewise, when the input happens to be already non-increasing (i.e. reverse-sorted), the algorithm takes only O(n) time; (c) but in any other situation, the algorithm may take O(n2) time. Justify that your algorithm meets these efficiency goals