Consider the assignment problem having the following cost matrix Assignee A B C D Assignment 1 2 3 4 4 1 0 1 1 3 4 0 3 2 1 3 2 2 3 0 (a) Reformulate this as an equivalent transportation problem by constructing the appropriate cost and requirements table. (b) Use the northwest corner rule to obtain an initial basic feasible solution for the problem as formulated in part 6a. (c) Starting with the initial basic feasible solution from part 6c, use the transportation simplex method to obtain an optimal solution for the problem as formulated in part 6a. (d) Formulate the linear programming model for this problem, and construct the initial simplex tableau. (e) Solve the problem by the Hungarian algorithm. Consider the assignment problem having the following cost matrix Assignee A B C D Assignment 1 2 3 4 4 1 0 1 1 3 4 0 3 2 1 3 2 2 3 0 (a) Reformulate this as an equivalent transportation problem by constructing the appropriate cost and requirements table. (b) Use the northwest corner rule to obtain an initial basic feasible solution for the problem as formulated in part 6a. (c) Starting with the initial basic feasible solution from part 6c, use the transportation simplex method to obtain an optimal solution for the problem as formulated in part 6a. (d) Formulate the linear programming model for this problem, and construct the initial simplex tableau. (e) Solve the problem by the Hungarian algorithm