[Solved]Know N 2 Spies S S1 82 Sn T Communicating Certain Number Communication Channels Fact J Kn Q37155716

This is a question about Max Flow. Please givea detailed answer, thank you.

You know that n+2 spies S, s1, 82,… , Sn and T’ are communicating through certain number of communication channels; in fact, for each i and each j you know if there is a channel through which spy s, can send a secret message to spy sj or if there is no such a channel i.e., vou know what the graph with spies as vertices and communication channels as edges looks like) (a) Your task is to design an algorithm which finds the fewest number of channels which you need to compromise (for example, by placing a listening device on that channel) so that spy S cannot send a message to spy T through a sequence of intermediary spies without the message being passed through at least one compromised channel. (b) Assume now that you cannot compromise channels because they are encrypted, so the only thing you can do is bribe some of the spies. Design an algorithm which finds the smallest number of spies which you need to bribe so that S cannot send a message to T’ without the message going through at least one of the bribed spies as an intermediary. Show transcribed image text You know that n+2 spies S, s1, 82,… , Sn and T’ are communicating through certain number of communication channels; in fact, for each i and each j you know if there is a channel through which spy s, can send a secret message to spy sj or if there is no such a channel i.e., vou know what the graph with spies as vertices and communication channels as edges looks like) (a) Your task is to design an algorithm which finds the fewest number of channels which you need to compromise (for example, by placing a listening device on that channel) so that spy S cannot send a message to spy T through a sequence of intermediary spies without the message being passed through at least one compromised channel. (b) Assume now that you cannot compromise channels because they are encrypted, so the only thing you can do is bribe some of the spies. Design an algorithm which finds the smallest number of spies which you need to bribe so that S cannot send a message to T’ without the message going through at least one of the bribed spies as an intermediary.

Expert Answer

---

Answer to You know that n+2 spies S, s1, 82,… , Sn and T’ are communicating through certain number of communication channels; in… . . .