The algorithm described in Fig. 16.21 is assumed to build the TO-broadcast communication abstraction in the system model CAMPn,t[- FC, CONS], which is CAMPn,t[CONS] weakened by fair channels (as...

The algorithm described in Fig. 16.21 is assumed to build the TO-broadcast communication

abstraction in the system model CAMPn,t[- FC, CONS], which is CAMPn,t[CONS] weakened

by fair channels (as defined in Section 3.1.2).

This algorithm is obtained by modifications of the algorithm described in Fig. 16.3. The lines

with the same number in both algorithms are the same. The modified lines are prefixed by M in

Fig. 16.21. The code of the operation TO broadcast() is different in both algorithms, and there

is a new task T1 whose aim is to cope with message losses.

Is this algorithm correct? In this case prove it. If it is not, describe a counter-example.