a. Prove that no asynchronous t-Byzantine-robust broadcast algorithm exists for t=N/3.
b. Prove that during the execution of Algorithm 14 .6 at most N(3N + 1) messages are sent by correct processes.
Text Book: Introduction to Distributed Algorithms By Gerard Tel.