Answer:
168 ways
Step-by-step explanation:
Given
[tex]Junior = 7[/tex]
[tex]Senior = 3[/tex]
Required
Number of ways 3 project can be assigned
Starting with the second project.
This can be assigned to only senior coders
So:
[tex]n_1 = 3[/tex]
Then, the third project.
This can be assigned to only junior coders
So:
[tex]n_2 = 7[/tex]
At this point, we are left with 2 senior coders and 6 junior coders
Since the first can be assigned to anybody.
[tex]n_3 =2+ 6[/tex]
[tex]n_3 =8[/tex]
The number of selection is then calculated as:
[tex]n = n_1 * n_2 * n_3[/tex]
[tex]n = 3 * 7 * 8[/tex]
[tex]n = 168[/tex]