Given unlimited supply of M & M's and of bugglegum, which cost one cent each, and of sourballs, peppermints, as well as gumdrops, which cost two cents each. You're going to purchase n cents worth of candy, one piece at atime. Letan be the number of selection sequences that end up costing n cents.Soa2 = 7 ( mm,mb, bb, bm, s, p, g). Order matters.
Determine a recursion relation for a n. Solve the recursion. Find a formula for an.