Advanced Algorithms Design and Analysis

Show your steps as in how will I solve this kind of question.

There are already answers to the same question so please do not copy them. I want to understand the concept so I can do other questions like this by myself..

TIA

1. Given an array A[1. .n] representing a sequence of n integers, in the same order as monotonic if it isa sequence of to be the length ofa subsequence of A[1. .i] that must recurrence for LMS (i) and calculates LMS(i) for 1-1..n. a subsequence is asubset of elements of A, they appear in A. A subsequence is strictly increasing numbers. Define LMS (i) longest monotonically increasing have A[i] as its last element. Write a convert into a dynamic program that