$S=\left(s_{0}, s_{1}, s_{2}, \ldots, s_{n-1} ight) $ is a sequence of numbers, describe an $0\left(n^{2} ight) $ algorithm for finding a longest increasing subsequence $T$ of numbers. That is $t_{i}