A factory produces automobiles at three plants. Plant 1 can produce 50 cars per week; plant 2, 100 cars per week and plant 3, 50 cars per week. The cars are sent to three agencies. The profits obtained per car are presented in the following table:

	agency1	agency 2	agency 3
Plant 1	75	60	69
Plant 2	79	73	68
Plant 3	85	76	70

Agency One is willing to buy 80 cars per week, Agency Two 90, and Agency Three 100. The factory wants to find a shipping plan that maximizes profit.

Use the transport algorithm to find the optimal solution and represent it on the bipartite graph.