Apply branch and bound algorithm to assign the tasks as follows:

There are n people who need to be assigned to execute n jobs, one person per job. (That is, each person is assigned to exactly one job and each job is assigned to exactly one person.) The cost that would accrue if the ith person is assigned to the jth job is a known quantity C[i, j]for each pair i, j = 1, 2, . . . , n. The problem is to find an assignment with the minimum total cost.

Draw the state space tree for the following instance.

	Job 1	Job 2	Job 3	Job 4	Job 5
Person A	9	6	5	7	3
Person B	5	4	8	9	2
Person C	5	6	8	5	4
Person D	4	5	6	9	5
Person E	6	7	4	9	3