Let L be an array of n distinct integers. Write and implement an efficient algorithm to find the length of a longest increasing subsequence of entries in L. For example, if the entries are 11, 17, 5, 8, 6, 4, 7, 12, 3, a longest increasing subsequence is 5, 6, 7, 12.

1. Executables (Your program must be easy to run-20pts, correctness -40 pts, efficiency-20 pts.)

2. Discussion of problem solving technique used and why chosen and its analysis with pseudocode (at least one order notation) (20 pts)