a$.)$ First, find the maximum flow from source S to sink T in the network in Picture. The weights on the edges represent the capacities of the edges.

b$.)$ Then, sing Prim's algorithm, find the minimum spanning tree in the graph obtained by replacing each directed edge in the network in picture with an undirected edge while keeping the weights unchanged. Start constructing the solution from node S$.($If you wish, you can arbitrarily label nodes that do not have labels for easier presentation of the solution.$)$