You know thatn+ 2 spies S, s1, s2, . . . , sn and T arecommunicating through certain number of communication channels; infact, for each i and each j you know if there is a channel throughwhich spy si can send a secret message to spy sj or if there is nosuch a channel(i.e., you know what the graph with spies as verticesand communication 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 channel) so that spyScannot senda message
OR
OR