7. You have access to 1x1 tiles which come in 2 different colors and 1x2 tiles which come in 3 different colors. We want to figure out how many different 1 x n path designs we can make out of these tiles. (a) Find a recursive definition for the sequence an of paths of length n. (b) Solve the recurrence relation using the Characteristic Root technique