repl.it HW/3 - A3-Recursion! This is a preview.Take or import to see all content DUE back ho clnssrocnm un Irstructions fram your eacher 1 acalinaten 1- factorial(n> Racursively calculate n" 5- ihn The factorial of a poairive integer (n!) is the prodoct of that amber tines all inregers less than it and greater than O For exansple. a!-4 sively alculate the nth Foncc usher. Your t The Fibonacci ambers are a sequence of mambers obtained by summing the two previous muabers in the series. That is, fib(n) Fih(n-1) + fib(n-2) with the hase cases of fihe) and fib(1)-1 factorial)1 factorial(4) -- faclor isl()720 factorial(16) 3628800 fib(e) -- fib(1)1 fib() fib(16)987 ib(206765 Pylhkm 3.6.1 (defaull, Der 2015, 13:05:11) x4.821 n linux