(
) Prove that for every computation C, every protocol must send at least 2n − 1 messages in the worst case to detect the global termination of C.