There are three security companies serving to three cities. Cities $1$ and $2$ requires $2$ security

personnels while city $3$ requires $3$ security personnels. The cost of responding to each incident

depends on the time at which security personnels arrive. For instance if tij is the time when ith

personnel arrives to city $j,$ then the cost of responding to that incident is given in below

equations.

Incident at city $1$:$4t11+6t12$

Incident at city $2$:$7t21+3t22$

Incdent at City $3$:$6t31+4t32+8t33$

If three security companies can respond to all cities, and company $1$ has $3$ security personnels

and companies $2$ and $3$ each have $2$ security personnels, and the time it takes to arrive from

each company to each city is given in Table $1$ then formulate a balanced transportation

table, minimizing the cost of incidents at each city. $($There must be $7$ demand points!!!$)(30$

pts$)$