a) A supervisor who has five gangs of masons located at different towns wishes to assign five sites in a way that will minimize the total distance travelled by each gang the allocation is always one gang to one site. The distances in kilometres of each gang to each site location are shown in the table below. i. Compute the total minimum cost. ii. Determine the optimal assignment using the Hungarian method and cross check with Penalty method