Let G be a complete networks where k < n − 1 links may occasionally lose messages. Consider the following 2-steps process started by an entity x:

first x sends a messageM1 to all its neighbors; then each node receiving the message from x will send a messageM2 to all its other neighbors. Prove that every entity will receive either M1 or M2.