(i) T(n) denote the number of distinct ways that a postage of ncents, where n ? 4 and n is even, can be made by 4-cent and 6-centstamps. Find a recurrence relation T(n). NOTE [4,6] is the same as[6,4] so T(10) = 1 so T(n) is NOT T(n-4)+T(n-6)
(ii) Now assume we have 10-cent stamps in addition to the previous2 kinds. Find a recurrence relation, S(n), for the number ofdistinct ways that a postage of n cents, where n ? 4 and n is even,can be made by 4-cent, 6-cent and 10-cent stamps.
