Longest Increasing Subsequence in Scheme Language

This problem must be written in the Scheme programming language, so please only provide an answer in that language! :)

The goal is to write a scheme function which computes the longest increasing subsequence from a list of numbers.

For example, if you type

> (lis '(1 2 3 2 4 1 2)) 

you might get

(1 2 3 4)

Please create this function in the Scheme programming language by following the pseudocode below, which follows an exhaustive search approach:

for i := n downto 1, where n is the length of the input list for all i-element sublists s of the input list if s is an increasing sequence of numbers print s and quit