Now, suppose that Doug has a third option for handling each unit of garbage $($of any day$)$:

$(3)$ garbage can be placed into temporary storage $---$ this is free. At the start of the n

days, the storage facility is empty, and it should be empty again at the end.

As in part $($a$),$ the problem is to process all the garbage while minimizing the total cost.

Formulate this problem as a Transshiphment Problem. Your solution should include a drawing of the network that has a label for each node $($e$.$g$.,$ v$1,$v$2,...$

$)$; moreover, for each node i

$,$ the demand bi

should be indicated next to the node, and for each arc $($i$,$j$)$

$,$ the cost of the arc w$($i$,$j$)$

should be indicated next to the arc.

Check that the temporary storage constraints are handled correctly.

$($c$)$ Use the Gurobi software to find an optimal solution to your Transshipment Problem of part $($b$),$ using the following parameters:

For j$=1,...,8$

$,$ define Ij

to be the j

$-$th digit in your student ID I$1$I$2$I$3$I$4$I$5$I$6$I$7$I$8$

$($e$.$g$.,$ I$1=2,$I$2=0$