Please complete the following in Lisp. I will rate, thanks!

1. Write a recursive function that returns the Fibonacci number where the Fibonacci sequence is

defined as;

fib(0)=0, fib(1)=1 and fib(n)=fib(n-1)+fib(n-2) for n>1

Examples:

n= 0 1 2 3 4 5 6 7 8 9...

fib(n)= 0 1 1 2 3 5 8 13 21 34...

2. In a comment, describe what the following code do when it is executed; also, provide an equivalent method/function myPrint in Java or C/C++

(defun myPrint (1)

(if (not (null 1))

(progn

(print (car 1))

(myPrint (crd 1))

)

)

)

; running f

(myPring (quote (1 2 3 4 5)))

; running f again

(myPringt (quote (6 7 8 9 0)))

; running f one more time

(myPrint (quote ("a" "e" "i" "o" "u")))