Use any text editor to create the lisp file. Should just be one source file for each function.

Function 3: fib In CLISP define a function using recursion to compute the Fibonacci number of n (where n is a positive integer) a. for n = 0 or n for n > 1 1 Fib(n) = 1 Fib(n) = Fib(n-1)-Fibn-2) Input: A positive integer used to calculate a Fibonacci number Output: The value returned given the input integer Examples >(fib 1) (fib 5) (fib 10) 89 Function 4: my-map In CLISP define your own function that duplicates the functionality ofmapcar from the standard library. You may not use the built-in mapcar function as a helper function. Your implementation must be recursive * Input: The input to my-map is a function that takes a single argument and a a. homogeneous list of elements of the same data type compatible with the procedure Note: the function argument can be named or anonymous (lambda) . Output: A new list of the original elements with the same procedure applied to each. . Examples > (my-nap #'sqrt'(9 25 81 49)) (3 5 9 7) > (my-map #1+ '(6 4 8 3)) (7 59 4) >(my-map (lambda (n) (* nn) 5 7)) "(25 49) > (my-map #evenp'(2 5 7 12))