To be coded in DrRacket in ISL+ (Intermediate Student with Lambda)

Exercise 2 Design all-leafy-trees which consumes a natural number n and creates (a list of all leafy binary trees of height n Here are a few tests that should pass: (List 'Leaf)) (check-expect (check-expect (ali-leafy-trees 0) (all-leafy-trees 1) (list (make-node 'eaf 'leaf))) (check-expect (all-leafy-trees 2) (list (make-node (make-node 'leaf 'leaf) 'leaf) (make-node 'leaf (make-node 'Leaf 'leaf)) (make-node (make-node 'leaf 'leaf) (make-node 'leaf 'leaf)))) (check-expect (length (all-leafy-trees 3)) 21) Exercise 2 Design all-leafy-trees which consumes a natural number n and creates (a list of all leafy binary trees of height n Here are a few tests that should pass: (List 'Leaf)) (check-expect (check-expect (ali-leafy-trees 0) (all-leafy-trees 1) (list (make-node 'eaf 'leaf))) (check-expect (all-leafy-trees 2) (list (make-node (make-node 'leaf 'leaf) 'leaf) (make-node 'leaf (make-node 'Leaf 'leaf)) (make-node (make-node 'leaf 'leaf) (make-node 'leaf 'leaf)))) (check-expect (length (all-leafy-trees 3)) 21)