CPSC 170 Lab 11
Recurrence Equations and Doubly Linked Lists

Use the expand-guess-verify method to find a closed form solution for each recurrence equation below: 
  1.   T(1) = 7
  T(n) = 2 + T(n-1)














































  2.   F(1) = 2
  F(n) = 2n + 2*F(n-1)