4. You know that n +2 spies S, s1, s2,…, 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 si can send a secret message to spy sj or if there is no such a channel (i.e., you know what the graph with spies as vertices and communication channels as edges looks like) (a) Your
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured