Really struggling in this worksheet for discrete structures, can someone show me the proper way?

1. A toll booth accepts only nickels, dimes, and quarters a. Find a recurrence relation for the number of ways to deposit n cents in the toll booth, where the order in which the coins are deposited matters. b. What are the initial conditions? 0. 2. A string that contains only 0s, 1s, and 2s is called a tenary string (12) a. Find a recurrence relation for the number of tenary strings of length n that contain two consecutive 1s b. What are the initial conditions? 128 01 60 X2 c. How many tenary strings of length six that contain two consecutive 1s? 49 144 41 8 3 ? 3. Suppose fin)-3Rn4) + 2 when n is divisible by 2, and f(1). 1. a. Find f(64). b. Find (256). 2 x 3 3(n) +2 SI IS llo 1 112