Chapter 5: Induction and Recursion (Part 2)Elements of Discrete StructuresRecursively Defined Functions Define a function f(n) recursively, n is an integer and n 0 : Basis Step: Specify the value of the function at n = 0 (or a special value): f(0) Recursive Step: For n 0, specify a rule for producing the value of f(n+1) from f(n) Example: f(0) = 3 f(n+1) = 2f(n) + 3f(3) = 2f(2) + 3 = 2(2f(1) + 3) + 3 = 2(2(f(0) + 3) + 3) + 3 = 2(2(3 + 3) +3) + 3 = 45Recursive Function Example Recursive definitio