As in the previous problem, consider the arrangement of learning bridges shown in Figure 3.38. Assuming all are initially empty, give the forwarding tables for each of the bridges B1-B4 after the following transmissions:
Figure 3.38

¦ D sends to C.
¦ C sends to D.
¦ A sends to C.