Function 3: fib In CLISP define a function using recursion to compute the Fibonacci number of n (where n is a positive integer) This Fibonacci definition is not the normal definition. Your function must match the definition below. a. Fib(n) = 2 Fib(n) = Fib(n-l) + Fib(n-2) for n-0 or n-1 for n > 1 Input: A positive integer used to calculate a Fibonacci number Output: The value returned given the input integer Examples: (ib I) >(fib 5) 16 > (fib 10) 178