Find the longest increasing subsequence of a given array of integers, A

Question

Please dont post code

find a subsequence of array in which the subsequence’s elements are in strictly increasing order, and in which the subsequence is as long as pos