Consider the obvious algorithm for chocking whether a list of integers is sorted: start at the beginning of the list, and scan along until we first find a successive pair of elements that is out of order. In that case, return false. If no such pair is found by the time we reach the end of the list, return true. Our elementary operation is a comparison between two integers. (a) What is the worst case running time of this algorithm on an input list containing n elements? Write all 5-element input lists which contain the numbers 1, 2, 3, 4, 5 and yield the worst case. (b) What is the best case running time of this algorithm on an input list with n elements? How many input lists are there which have size n, all elements being different, and yield the best case? (c) Suppose that the input list is a random permutation of 1, 2, ..., n and all such permutations are equally likely. Derive the average-case expected running time. Give both an exact and asymptotic