Question

06. Do any two of the following three parts Q6(a). Solve the following recurrence relation; Q6(b). Find a recurrence relation for an, which is the number of n-digit binary sequences with no pair of consecutive 1s. Explain your work. Q6(c) Solve the following problem using the Inclusion-Exclusion formula. How many ways are there to roll 8 distinct dice so that all the six faces appear? Hint: Use N(A'n n. NU)-S-,-1)' )-S-S2+S-(-1)Sn U- All possible rolls of 8 dice, Aj-Roll of 8 dice where the face 1 does not appear, etc

Answer 1

IF YOU HAVE ANY DOUBTS COMMENT BELOW I WILL BE TTHERE TO HELP YOU..ALL THE BEST..

AS FOR GIVEN DATA...

-O CamScanner

HOPE IT HELPS YOU

RATE THUMBSUP IT HELPS ME ALOT

THANKS