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: The objective is to assign the four ships to four different ports in such a way as to minimize the total cost for all four shipments. Describe how this problem fits into the general format for the assignment problem. Obtain an optimal solution. Reformulate this problem as an equivalent transportation problem by constructing the appropriate parameter table. Use the northwest comer rule to obtain an initial BF solution for the problem as formulated in part (c). Starting with the initial BF solution from part (d), interactively apply the transportation simplex method to obtain an optimal set of assignments for the original problem. Are there other optimal solutions in addition to the one obtained in part (e)? If so, use the transportation simplex method to identify them