3. Consider the assignment problem having the following cost table. Job 1 2 3 B Person 5 3 2 7 6 3 4 5 4 (a) Formulate the assignment model for this problem and write the mathematical formula- tion. Find the optimal solution, optimal objective value using the Hungarian algorithm. Interpret the solution. 2 (b) Reformulate this problem as an equivalent transportation problem by constructing the appropriate parameter table. (c) Use the northwest corner rule to obtain an initial BF solution for the problem as formu- lated in part (b). (d) Starting with the initial BF solution from part (c), apply the transportation simplex method to obtain an optimal set of assignments for the original