3(b) (6%) Show how to find the maximum number of node-disjoint paths from the source to the sink (same graph as part (a): 6 nodes, $s=1$, $t=6$). This means that you should construct a set of paths such that every node, except for the source and sink, may appear in at most 1 path.