We want to move the system from an initial configuration where every entity is in the same status ignorant except the one that is knowledgeable to a final configuration where every entity is in the same status. Consider this problem under the standard assumptions plus Unique Initiator.

(a) Prove that, if the unique initiator is restricted to be one of the ignorant entities, this problem is the same as broadcasting (same solution, same costs).

(b) Show how, if the unique initiator is restricted to be the knowledgeable entity, the problem can be solved without any communication.