4. (14 pts) Write a recursive Scheme function (flatten L), which takes as arguments a list L (possibly containing sublists), and returns a list containing al elements in L and its sublists, but all at the same level. The following example illustrates the use of this function: (flatten' (1 (2 (3 4)) 5)) (1 2 3 4 5)