Consider the scheme function definition:

(define (f n) (if (= n 0) 1 (* n (f (- n 1)))))

which one of the following statements is true:

1. The expression (> (f 8) 80) evaluates to a list.

2. The expression (f 2) evaluates to a boolean value.

3. The expression (+ (f 4) 4) evaluates to an integer.

4. The function f makes at least one recursive call to itself whenever it is called.

5. The expression (- n 1) should be (n - 1) in Scheme syntax.