Question 3 (25 marks) (a) Consider the transportation problem having the following table. Source 1 Source 2 Source 3 Demand 1 3 2 4 3 2 7 4 3 3 Destination 3 6 3 8 2 NUNAA 4 4 2 5 2 Supply 5 2 3 Use each of the following criteria to find the initial basic feasible solutions using Northwest comer method. [10 marks] (b) Four cargo ships will be used for shipping goods from one port to four other ports (labeled 1, 2, 3, 4). Any ship can be used for making any one of these four trips. However, because of differences in the ships and cargoes, the total cost of loading, transporting, and unloading the goods for the different ship-port combinations varies considerably, as shown in the following table: Port 2 3 4 Ship 1 2 3 4 $500 $600 $700 $500 $400 $600 $500 $400 $600 $700 $700 $600 $700 $500 $600 $600 Use the Hungarian method to assign the four ships to four different ports in such a way to minimize the total cost for all four shipments. [15 marks)