1. Problem: Covering a 2 x n grid. a. Find a recurrence relation for C, the...

Transcribed Image Text:

1. Problem: Covering a 2 x n grid. a. Find a recurrence relation for C₁, the number of ways to cover a 2 x n grid using 2 x 1 tiles. Make sure to include your initial conditions. b. Solve your recurrence relation by describing the nth term explicitly. 1. Problem: Covering a 2 x n grid. a. Find a recurrence relation for C₁, the number of ways to cover a 2 x n grid using 2 x 1 tiles. Make sure to include your initial conditions. b. Solve your recurrence relation by describing the nth term explicitly.