1. True/False: Racket is a dialect of Scheme, which is a minimal LISP-family language. 2. True/False: Functional programming is mainly about ensuring correctness and functionality through assertions and contract checks. 3. True/False: The substitution model for procedure application is a way of modeling function invocation using a textual-reduction semantics. 4. True/False: Applicative-order evaluation is also called normal-order evaluation. 5. True/False: A first-class function is a function that may be treated as a value. 6. True/False: The function car is called an accessor. 7. True/Fa.lse: Dynamic lookup (also called dynamic dispatch) applies to all method calls in both C++ and Java.. 8. True/False: A box-and-pointer diagram is also called a cons diagram. 9. True/False: Any structure built from cons-cells in Scheme is a proper list. 10. True/False: The natural way to write a list-reversing function recursively is using direct or na.tural recursion, not tail recursion. 11. True/Fa.lse: In the expression (if e0 e1 e2), only the expression e2 is in tail position. 12. True/False: In Racket, a. let* form executes all right-hand-side expressions simultaneously