Question $/$ Code $(1\mathrm{.}3)(2\mathrm{.}5$ Mark$)$:

Find the optimal solution by the Stepping Stone method

$\backslash$table$[[$S$/$D$,$D$1,$D$2,$D$3,$SUPPLY$],[$S$1,8,80,2,$x$,5,$x$,80],[$S$2,6,40,4,20,3,$x$,60],[$S$3,2,$x$,3,30,1,70,100],[$DEMAND$,,20,,50,,70,]]$

Question $2$ Code $(2\mathrm{.}3)(2\mathrm{.}5$ Marks$)$:

Construct a network for a project whose activities and their predecessor relationship are given in Table

$\backslash$table$[[$Activity$,$A$,$B$,$C$,$D$,$E$,$F$,$G$,$H$,$I,J$,$K$],[$predecessor$,-,-,-,$A$,$B$,$B$,$C$,$D$,$E$,$H$,$ I,F$,$ G$]]$