Remarks: In all the algorithms, always explain their correctness and analyze their com- plexity. The complexity should be as small as possible. A correct algorithm with large complexity, may not get full credit. Question 3: Give an algorithm that finds the maximum size subarray that is increasing (the entries may not be contiguous. It may be any set but you need to keep the order.). For example in the array 7, 2, 6, 4, 1, 7, 2, 10 the maximum non contiguous array is 2, 4, 7, 10