Suppose two learning bridges B1 and B2 form a loop as shown in Figure 3.50 and do not implement the spanning tree algorithm. Each bridge maintains a single table of address, interface pairs.

(a) What will happen if M sends to L?

(b) Suppose a short while later, L replies to M. Give a sequence of events that leads to one packet from M and one packet from L, circling the loop in opposite directions.

Figure 3.50)

B1 L M B2