[" No of ways in which "3" sovereings be given away to "4" applicants and any applicant may have either "0,1,2" and "3" sovereings is "],[[" (A) "18,],[" (B) "16],[" (c) "19],[" (D) "20]]

Number of ways in which 3 sovereings be given away to 4 applicants and any applicant may have either 0, 1, 2 and 3 sovereings is

In how many ways can 3 sovereigns be given away when there are 4 applicants and any applicant may have either 0,1,2 or 3 sovereigns?

Assertion (A): The number of ways in which 4 sovereings can be given away when there are 6 applicants and any applicant may have either 0, 1, 2, 3 or 4 sovereigns is 126. Reason (R) : The number of ways that n sovereigns can be given away when there are k applicants and any applicant may have either 0,1,2,.... or n sovereigns is ""^((n+k-1))C_(k-1) . The correct answer is

The number of ways in which 16 sovereigns can be distrbuted among three applicants such that each applicant does not receive less than 3 sovereigns, is

The number of ways in which 16 sovereigns can be distrbuted among three applicants such that each applicant does not receive less than 3 sovereigns, is

In how many ways 3 prizes can be given away to 7 boys when each boy is eligible for any of the prizes.