1. Give a rational for your answer to the previous question.

a. True

b. False

2. The following function recursively computes the factorial of x, x!. Is the implementation tail recursive?

(define (fact x) (if (

a. True

b. False

How much memory (in OO notation) is required for computing (fact X), measured as a function of X?

a.	O(1) - constant space

b.	O(log n) - log space

c.	O(n) - linear space

d.	O(n log n) - loglinear space

e.	O(n^2) - quadratic space