Suppose $|A|$ =8 And $| B |$ =4 Find the Number of Functions

Q4: write the first seven terms of

Q5: find a closed form for the generating

Q6: What form does a particular solution

Q7: find a closed form for the generating

Q8: solve the recurrence relation either by

Q10: Set up a generating function and use

Q11: What form does a particular solution

Q12: Set up a generating function and use

Q13: describe each sequence recursively. Include initial conditions

Q14: How many permutations of all 26 letters