Problem $4\mathrm{.}6($Textbook $-$ Diwekar$)$

$4\mathrm{.}6$ Given a mixture of four components A$,$ B$,$ C$,$ D for which two separation technologies $($given in Table $4\mathrm{.}8)$ are to be considered.

Determine the tree and network representation for all the alternative sequences.

Find the optimal sequence with the depth$-$first strategy.

Find the optimal sequence with the breadth$-$first strategy.

Heuristics has provided a good upper bound for this problem. The cost of the separation should not exceed $$91,000.$ Use the depth$-$first strategy to find the solution.

Compare the solution obtained by using the heuristic upper bound from part $4)$ with the solution obtained when this upper bound is not available

Table $4\mathrm{.}8.$ Cost of separators in $\frac{\text{\$}}{?}$ year.

$\backslash$table$[[$Separator$,$Cost$],[\frac{A}{B}CD,50,000],[A\frac{B}{C}D,56,000],[AB\frac{C}{D},21,000],[\frac{A}{B}C,40,000],[A\frac{B}{C},31,000],[\frac{B}{C}D,38,000],[B\frac{C}{D},18,000],[\frac{A}{B},35,000],[\frac{B}{C},44,000],[\frac{C}{D},21,000]]$