Problem 1-3. Mostly Sorting (50 points] In this problem we consider the task of deter- mining whether an array of numbers is sorted or not, without examining all elements in the array. In order to do this, your algorithm is not required to give the correct answer if the array is mostly sorted but not completely sorted. Precisely, given a array A of n elements, we say that S is mostly sorted if it contains a sorted subsequence of length at least on. The sorted subsequence is not necessarily contiguous. That is, you can remove some k