Pls use Hungarian algorithm, i.e with bipartite graph to get the minimum total cost for the question.

I am stuck in the middle of the workings. V much appreciated if anybody can explain in detail clearly. Thxs

(Answer is $1110)

Question 9 14 pts Four factories A1, A2, A3 and A4, can supply 88, 30, 62 and 40 units of product, respectively. The demands for these products at four warehouses, B1, B2, B3 and B4 are 45, 60, 65 and 50 units, respectively. The costs of transporting one unit of product from each factory to each warehouse are given in the following cost matrix. B1 B2 B3 B4 A1 3 10 5 6 A2 7 9 7 8 A36 7 20 5 A4 6 5 4 7 Find a minimum-cost solution to this transportation problem, using the Hungarian algorithm The total transportation cost of your solution is. Question 9 14 pts Four factories A1, A2, A3 and A4, can supply 88, 30, 62 and 40 units of product, respectively. The demands for these products at four warehouses, B1, B2, B3 and B4 are 45, 60, 65 and 50 units, respectively. The costs of transporting one unit of product from each factory to each warehouse are given in the following cost matrix. B1 B2 B3 B4 A1 3 10 5 6 A2 7 9 7 8 A36 7 20 5 A4 6 5 4 7 Find a minimum-cost solution to this transportation problem, using the Hungarian algorithm The total transportation cost of your solution is