# Question: let x x1 x2 xn...

###### Question details

Let X = x_{1}, x_{2}, . . . , x_{n} be a
sequence of n integers. A sub-sequence of X is a sequence obtained
from X by deleting some elements. Give an O(n^{2})
algorithm to find the longest monotonically increasing
sub-sequences of X.