Aset of blocks contains blocks of heights 1, 2, and 4 centimeters. imagine constructing towers by piling blocks of different heights directly on top of one another. (a tower of height 6 cm could be obtained using six 1 cm blocks, three 2 cm blocks, one 2 cm block with one 4 cm block on top, one 4 cm block with one 2 cm block on top, and so forth.) let tn be the number of ways to construct a tower of height n cm using blocks from the set. (assume an unlimited supply of blocks of each size.) find a recurrence relation for t1, t2, t3, . for each integer, n ≥ 5, tn = n+2