Problem $3-1($Algo$)$

Use the process information provided in the following table, when the sequence of flow is $\backslash ($ A $\backslash$rightarrow B $\backslash )($any machine can be used if available$)\backslash (\backslash$rightarrow C $\backslash$rightarrow D $\backslash )($any machine can be used if available$).$

Calculate the maximum $($design$)$ capacity and effective capacity.

Note: Round "Effective capacity" to $\backslash (\backslash$mathbf$\{2\}\backslash )$ decimal places.