a 5 Write a scheme function (recursive) to get any number of numeric atoms and return their multiplications. For example, (* 2 3 4 5) returns 120. a 6 Write a scheme function to calculate factorial of n (where n is a positive integer). Write a scheme function that get a simple list and returns the simple list appended to its reverse list. 8, write a scheme function that take a simple list of numbers and return the larges and smallest numbers in the list a 9 Write a recursive scheme function EXP-DEPTH that returns the depth of the most nested parentheses in a list. (EXP-DEPTH 'A) is 0, (EXP-DEPTH')) is 1, (EXP-DEPTH (1 2 3)) should return 1. (EXP-DEPTH '(lJ ((K) L) M)) should return 3, since the element K is nested in three levels of parentheses. Write a scheme function (EXP-EVAL) which evaluates an arithmetic 10. expression. The binary operators used for an arithmetic expression are: +,-, *, and/. (EXP-EVAL '(2+ (3 * 5)) should return 30. a