Problem $2(15$ points$)$ CSE $619$ students only

a$)$ Given a sequence of n real numbers A$=[$A$1,$ A$2,...$ An$],$ provide a dynamic$-$programming solution that finds a subsequence $($not necessarily contiguous$)$ of maximum length in which the values in the subsequence form a strictly increasing sequence.

b$)$ Apply your algorithm to the sequence A$=[3,-2,1,4,7,1].$ Show the dynamic programming table!!!

$$Write everything on a piece of paper