Sample LA: List Recursion

Write a recursive procedure, (increasing-length? words), that takes a list of strings as input and ensures that every string is at least as long as the previous string. If so, it returns true. If not, it returns false.

Here are some examples in action

(increasing-length (list))
#t
(increasing-length? '("hello")
#t
(increasing-length? '("a" "b" "cd" "efg" "hij" "klmn")
#t
(increasing-length? '("a" "bb" "ccc" "dddd" "eee")
#f