Let f : N 0 Z defined by the recurrence relation (recursive definition), f ( n ) = f ( n 1 ) + 5 , ( a n = a n 1 + 5 ) where f ( 0 ) = 3 (base case). Find a closed form solution for f ( n ) . (Use Forward Substitution Method or Backward Substitution Method) Terms: f ( 0 ) = 3 f ( n ) = ?.