Solved: a) Find the critical path, along with its total weight for the network below. (Label each

a) Find the critical path, along with its total weight for the network below. (Label each vertex with its longest path value, even if it is not in the critical path.

(b) Assign a maximal flow to the network below, and state the resulting flow value. Also indicate which edges should be included in a minimum cut.