[Solved]Know Thatn 2 Spies S S1 S2 Sn T Communicating Certain Number Communication Channels Fac Q37104871

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 to spy T through a sequence of intermediary spies withoutthe message being passed through at least one compromisedchannel.

(b) Assume now that you cannot compromise channels because theyare encrypted, so the only thing you can do is bribe some of thespies. Design an algorithm which finds the smallest number of spieswhich you need to bribe so that S cannot send a message to Twithout the message going through at least one of the bribed spiesas an intermediary.

Expert Answer

---

Answer to You know thatn+ 2 spies S, s1, s2, . . . , sn and T are communicating through certain number of communication channels; … . . .