Find longest increasing subsequence. Input: Number of tests T Number of numbers N N space separated numbers Output: For each test output the length of the longest increasing subsequence Sample: Input: 2 3 1 2 3 3 2 1 3 Output: 3 2