A commander is located at one node p in a network. His subordinates constitute a node set S. The enemy needs to cut off the communication between the commander and his subordinates (commander should not be able to communicate to any of his subordinates). Enemy needs w(e) effort to remove an edge e in the network. The goal is to compute the minimum effort required to cut off the communication between the commander and his subordinates. (a) Propose a polynomial-time algorithm for the special case when there is only one subordinate, i.e., S = {q} is a singleton. (b) Propose a polynomial-time algorithm for the general case