Three machine flowshop problem to minimize makespan:

Apply selected steps of Ignall$-$Schrage algorithm to determine selected branches of the search tree $($Do not determine the complete Branch and Bound tree$)$

$\backslash$table$[[$Job$,$A$,$B$,$C$,$D$],[$M$1,26,17,29,10],[$M$2,11,21,12,29],[$M$3,8,12,10,4]]$

Determine the q$1,$ q$2,$ and q$3$ numbers for the partial schedule $($B$,)(5$ pts$)$

a$.$ Determine the q$1,$ q$2,$ and q$3$ numbers for the partial schedule $($D$,{?}^{**,**,**})(5$ pts$)$

b$.$ Determine the q$1,$ q$2,$ and q$3$ numbers for the partial schedule $($B$,$C$,)(5$ pts$)$

c$.$ BONUS Question $($for $10$ max credit$)$ Determine the optimal sequence and present as a Gantt chart, or else a network diagram.