(a) Execute the painted network algorithm for the network below. Show the final routing and the outcome: either a painted path from N+ (node #10) to N- (nodes #5 and #9) or a cut compatible with the painting.

(b) Do the same, but reverse the roles of N+ and N-.