The following files are encoding of networks. Bridges are labeled
B_1, B_2, etc.LAN's are labeled
L_1, L_2, etc.Each line contains an interconnection,
B_x L_y,meaning bridge number x attaches to LAN y. The ID of bridge B_x is x.
Show the spanning tree algorithm convergence for the following networks.
Show configuration messages, the update of the root and distance to the root of each bridge, and the final decision whether each port is Block, Root, or Designated.Do a reasonable job showing how the updates occur. This is a distributed algorithm, so there is uncertainty about exactly how the updates are ordered. Just show a reasonable set of updates.