Hi, i would like some help regarding the question below:

The answer format to be something like this:

We want to assign 4 people to 4 jobs so that the total cost of the assignment is as small as possible. The constraint to the problem is that each job is assigned to only one person, and each person is assigned with only one job. The table gives the cost of a person completing a particular job. Job 3 3 4 Person A B D 19 4 3 2 5 3 1 4 4 5 3 2 5 16 2 16 Using branch-and-bound algorithm based on setting lower bounds by row, find an assignment (one only) of the four jobs to the 4 people such that the total cost of the assignment is optimal. You must number the node according to the order that you draw the state-space tree. The assignment problem: 58 64 First alternative: assign c and d to job i and 4 respectively, calculate the lower bound as follows: X > new Ub = 64 Lb =11+14+13+22=60 b1 Lb =12+14+19+23=68 6+1, 4 Lb =12+13+11+28=64 Lb =12+11+13+22=58 Lb =12+13+11+23=59 C +4, d > Lb =11+12+13+22=58 X >new Ub Lb =12+13+23+17=65 a 3 = 64 Lb =18+11+14+22=65 x Lb =12+22+11+19=64 Ub = 64 > new Ub=64 x >initial Ub Lb =40+11+14+13=78 Ifc31and d = 4, the lower bound cost is 12 + 13 + 23 + 17 = 65. start 3 b +4 4 1 2 a 4 3 4 a 11 12 18 40 b 14 15 13 22 11 17 19 23 d 17 14 20 28 We eliminate this new branch as Lb > Ub