Exercises from [MU], and the following problems from https://www.cs.cmu.edu/~avrim/451f13/lectures/lect0905.pdf
1. Show a family of graphs G2, G4,..., one for every n>=2, such that each graph Gn has n choose 2
minimum cuts. (This shows the result proved in the previous exercise is tight.)
2. Give a (multi)graph with a unique minimum cut C, such that the probability that our
algorithm outputs C is O(1/n^2)