2. Consider a completely connected network of n processes ( through n-1. In this network, some process i wants to broadcast a message m to every other process using a synchronous message-passing model. In each round, a process can forward a message to exactly one other process. The goal is to complete the broadcast as quickly as possible. Propose an algorithm using which the broadcast is completed in the fewest number of rounds (only the main idea using pseudo-codes is needed here). Calculate the time complexity in rounds