Let X = x1, x2, . . . , xn be asequence of n integers. A sub-sequence of X is a sequence obtainedfrom X by deleting some elements. Give an O(n2)algorithm to find the longest monotonically increasingsub-sequences of X.
Expert Answer
An answer will be send to you shortly. . . . .