Demand Consider the assignment problem having the following cost Table. Draw the network representation of this assignment problem. Solve the problem using Hungarian method. Task 2 3 8 Assignment7 8 7 S Solve the following problem using the Branch and Bound algorithm. Maximize 2x1 3x2 Subject to x 2x2 s3 6x1 8x2s 15 x1, x2 E Z+ Optimal solution found by simplex method is x1=1.5; x2=0.75. Find integer solution. Give relaxation formula in Dijkstra algorithm. Give illustration of the algorithm on the direct graph. Use vertex s as a source 0 35 Demand Consider the assignment problem having the following cost Table. Draw the network representation of this assignment problem. Solve the problem using Hungarian method. Task 2 3 8 Assignment7 8 7 S Solve the following problem using the Branch and Bound algorithm. Maximize 2x1 3x2 Subject to x 2x2 s3 6x1 8x2s 15 x1, x2 E Z+ Optimal solution found by simplex method is x1=1.5; x2=0.75. Find integer solution. Give relaxation formula in Dijkstra algorithm. Give illustration of the algorithm on the direct graph. Use vertex s as a source 0 35