Consider the interconnected LANs shown in Fig. 4-44. Assume that hosts a and b are on LAN 1, c is on LAN 2, and d is on LAN 8. Initially, hash tables in all bridges are empty and the spanning tree shown in Fig 4-44(b) is used. Show how the hash tables of different bridges change after each of the following events happen in sequence, first (a) then (b) and so on.
(a) A sends to d.
(b) C sends to a.
(c) D sends to c.
(d) D moves to LAN 6.
(e) D sends to a.