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

Options

A. `""^(16)C_(3)`
B. `""^(9)C_(2)`
C. `""^(9)C_(3)`
D. `""^(10)C_(2)`

Explanation

To solve the problem of distributing 16 sovereigns among three applicants such that each applicant receives at least 3 sovereigns, we can follow these steps:

### Step-by-Step Solution:

1. **Define Variables**: Let \( x \), \( y \), and \( z \) represent the number of sovereigns received by the three applicants. According to the problem, we have:
\[ x + y + z = 16 \]
...