Recursively Defined Sequence #2: Tilings Define the sequence T, = Number of different ways that an nX2 rectangle can be tiled with 1X1 and 1X2 tiles. For example T, = 7 (try out all the possible drawings) Give a recursive definition for T, Your definition must include: All the initial conditions of the sequence A recurrence relation for T, as a function of some of the elements of the sequence that precede it The values of n for which this recurrence relation applies An explanation with drawings of how this recurrence relation was derived