Consider the simple flooding algorithm seen during classes. The seen algorithm uses the flooding process to spread the ranking information among the graph nodes. Analyze the studied algorithm and decide if it is possible to reduce the communication process in one step. That is, all processes that are correct start to decide in (n - 1) communication steps. Give an example for a specific case of a system with 2 processes and an example for a case of a system with 3 processes.