1. Consider the interconnected LANS shown in Fig 1.1. Assume that the terminals a and b are on LAN-I, C is on LAN-2 and dis on LAN-8. Initially, hash tables in all bridges are empty and the spanning trees is used (Fig 1.11. Show how the hash tables of different bridges change after each of the following events happen in sequence. a. asends the connection request to d b. csends the connection request to a c d sends the connection request to c. dd moves the service connectivity to LAN-6. c. d sends the connection request to a B c 3 1 LAN D E 5 6 7 Bridge that is part of the spanning tree H 89 Bridge that is not part of the spanning tree Fig 1.1. Interconnected LAN When a sends to d: whole network is flooded A B D F G b. Whene sends to a A B C D G H c. Whend sends to A B D E G H d. Whend moves to LAN 6 A B D H e. Whend sends to a A B D E F G