Given the following Scheme definition:

(define x (define (fib n)

(if (<= n 1) n

(+ (fib (- n 1)) (fib (- n 2))))))

(This defines not the Fibonacci function fib, but the variable x.) Write Scheme expressions in terms of x that would have the effect of extracting the following expres- sions: (a) (fib n) (b) <= (c) (fib (- n 1)) (d) The third occurrence of fib. (e) The last occurrence of n. E.g.,theexpression(car x)wouldextractdefine.