Max-Flow Question with Hints
You know that n + 2 spies S, s1, s2, . . ., sn and T are communicating through certain number ofcommunication channels; in fact, for each i and each j you know ifthere is a channel through which spy si can send asecret message to spy sj or if there is no such achannel (i.e., you know what the graph with spies as vertices andcommunication channels as edges looks like).
(a) Your task is to design an algorithm which finds the fewestnumber of channels which you need to compromise (for example, byplacing a listening device on that
OR
OR