$4.)$PLEASE SOLVE IN EXCEL SOLVER

$\backslash$table$[[,$Store$],[$Warehouse$,1,2,3,4,],[1,6,5,8,7,],[2,5,8,6,5,],[3,6,4,4,4,]]$

$($a$)$ Draw the network representation of this problem. What kind of problem is this?

This is a maximal flow problem.

This is a transshipment problem.

This is a transportation problem.

This is a shortest path problem.

is is a minimal spanning tree problem.

$($d$)$ Suppose that shipments are not allowed between warehouse $1$ and store $2$ or between warehouse $2$ and store $3.$ What is the easiest way to modify the spreadsheet so that you can solve this modified problem?

Assign arbitrarily small costs such as $$0\mathrm{.}01$ to the arcs representing these flows.

O Assign arbitrarily large costs such as $$999$ to the arcs representing these flows.

$($e$)$ What is the optimal solution to the modified problem?

$(x_{11},x_{12},x_{13},x_{14},x_{21},x_{22},x_{23},x_{24},x_{31},x_{32},x_{33},x_{34})=()$