In how many ways can get three jobs I, II and III be assigned to three persons A, B and C if one person is assigned only one job and all are capable of doing each job?
In the question, we have to find the possible number of ways in which three jobs I, II, III can be distributed among three guys A, B, C, and one job can be assigned to one person only.
We will use the concept of multiplication because there are three sub jobs dependent on each other because a job assigned to one person cannot be assigned to another person.
The job I has three choices to be assigned and when it is assigned to one person , there are two persons left, and Job II can be assigned to only two persons after assigning Job II , Job III has only one choice because there is only one person left.
The number of ways in which we can distribute three jobs between three persons with the help of given data is 3 × 2 × 1 = 6.