Suppose you are given the following sequence A containing n $=7$ numbers: A $=[4,9,7,3,8,11,4].$ In this question you will have to follow along with the dynamic programming algorithm that finds the longest increasing subsequence of A$.$ Specifically, for each value i $=1,..\mathrm{.}7,$ compute the value LIS$($i$)$ representing the length of the longest increasing subsequence whose final number is A$[$i$].$ The following three questions will ask you to enter these values.

Flag question: Question $2$

Question $22$ pts

Enter LIS$(6)$