1. (16 points total - 2 points each) In each situation, write a recurrence relation, including base case(s), that describes the recursive structure of the problem. Briefly explain how you obtain your recurrence. You do not need to solve for the closed-form formula. Note: For parts (g) and (h) of this problem, to tile a rectangle" is to cover it with tiles so that no tiles overlap, no tiles are hanging off the edge of the rectangle, and every space on the rectangle is covered by some tile. 1. (16 points total - 2 points each) In each situation, write a recurrence relation, including base case(s), that describes the recursive structure of the problem. Briefly explain how you obtain your recurrence. You do not need to solve for the closed-form formula. Note: For parts (g) and (h) of this problem, to tile a rectangle" is to cover it with tiles so that no tiles overlap, no tiles are hanging off the edge of the rectangle, and every space on the rectangle is covered by some tile