a$)(15$ p$)$ Use Ford$-$Fulkerson algorithm to find the maximum flow for the following network.

b$)(5$ p$)$ Find a cut with capacity equal to this maximum flow.