Modify the synchronous flooding algorithm of Figure 5.17 so as to reduce the complexity, assuming that all the processes only need to know the highest process identifier among all the processes in the network. For this adapted algorithm, what are the lowered complexity measures?
