Question

Q 3: There are n identical balls and m different bins. Let Bn,m be the total number of way to put n balls in m bins.
(a) What are B1,1, B2,1, B1,2, B2,2, B3,2?
(b) Express Bn,m in terms of Bk;m-1, for k = 0,….. n.

Answer 1

I assume you have learned about the ball-and-bin problem in your calls. It may have been called the star-and-bar problem, which is easier to visualize mathematically.
Try to read over your notes and post your answer for a check if you wish.
If you still have difficulties, feel free to explain your attempt.
If your notes are incomplete, or if you were absent from class on the particular day, you can read up the following:
https://en.wikipedia.org/wiki/Stars_and_bars_(combinatorics)

Answer 2

*course

Answer 3

Need answer

Answer 4

Need answer for this question