Write a LISP function in DrRacket that will determine if a list of numbers is in increasing order from smallest to largest. The list should be only numbers and no embedded lists are included. The function returns T if the list is increasing and F if the numbers are not increasing or not all numbers. There must be at least 2 numbers to compare. Show a print out of the definition and execution windows.

(increasing (1 a 2 b 3 c)) = F

(increasing (1 4 7 8 9 11 21)) = T

(increasing (3 6 7 1 9 11)) = F

(increasing (2 3 3 5 8 9)) = F

(increasing (1)) = F

(increasing (a b c)) = F

(increasing ()) = F