Assessing Network Resilience Imagine a communication network where each node is a server and each link between servers represents a communication channel. A network$$s robustness can be measured by the smallest number of channels that, if disrupted, would split the network into isolated groups. For instance, a network organized like a line of servers requires just one link to be broken to cause a split, while a circular network needs two. Describe a method to determine the robustness of any server network by using a maximum$-$flow strategy on multiple network configurations. Prove correctness. Hint: Run flow $|$V $|1$ times, and carefully choose s and t in each run.