$.$ In the network shown below, the bold lines represent a minimum spanning tree.

$$ For each nontree arc $($k$,$ l$),$ verify that this tree satisfies the path optimality

conditions.

$$ For each tree arc $($i$,$ j$),$ verify that this tree satisfies the cut optimality

conditions.