Exercise 5.1. Below is a series of optimization problems that takes as input an array A[1..n] of integers, and asks for optimal subsequences of A satisfying certain properties. 9 Design and analyze an algorithm for each of these problems, addressing items 15 from section 11.1.3..10 1. A sequence of numbers x1,,xk is (strictly) increasing if xi