hello please explain this question step by stepthanx much (A) Find a recurrence relation for the number of n-digit sequences over the alphabet {0, 1, 2, 3, 4} with at least one 1 and the first 1 occurring before the first 0 (possibly no 0’s). (B) What are the initial conditions? (C) Solve the recurrence relation in Part (a) satisfying the initial condition