*Due Monday, March 2 at 5:00 PM. Please refer to the homework policy here.*

- Problem 3 in Chapter G of Jeff's notes. (Every year, Professor Dumbledore...)
- Let be an
*undirected*graph. Prove that there is (always) a pair of nodes such that either or is the minimum cut.