Combinatoricshard
0:00.0

Determine the number of ways to assign n=5n=5 distinct projects to k=4k=4 employees such that every employee receives at least one project, but one specific employee (Alice) receives exactly two projects.