Proof of an Optimal Broadcast Algorithm
Proof of optimality (by induction):RTP: For n-number of nodes the algorithm has O(n) maximum communication steps.For n=1: There are 0 communication steps.For n=2: There is 1 communication step.For n=k: There are k communication steps.For n=k+1: There is 1 communication…