Aset of blocks contains blocks of height 1, 2, 4 cm. imagine constructing towers by piling blocks of different heights directly on top of one another. (a tower of height 6cm could be obtained using six 1cm blocks, three 2 cm blocks, one 2 cm block with one 4cm block on top, one 4 cm block with one 2 cm block on top and so on.) let tn be the number of ways to construct a tower of height n cm using blocks from the set. (assume that the supply of blocks is unlimited.) find a recurrence relation for t1, t2, t3, ….. justify your anwer.