5-19. Suppose that selection sort is applied to a list that is already in sorted order. What is the time complexity of the algorithm this case? 5-20. 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) e Justify that your algorithm meets these efficiency goals