This is strictly scheme coding.

Write the procedure longest-increasing-subsequence, which takes in a list lst and returns the longest subsequence in which all the terms are increasing. Note: the elements do not have to appear consecutively in the original list. For example, the longest increasing subsequence of(1 2 3 4 9 3 4 1 10 5) is (1 2 3 4 9 10).

(define (long-s-seq lis)

your code here

)

Please follow the instruction. This is scheme code.