What is the size k of the minimum vertex cut set between s and t in this network?
Prove your result by finding one possible cut set of size k and one possible set of k independent paths between sand t. Why do these two actions constitute a proof that the minimum cut set has size k?