5. (20 points) In the picture below assume node B sends a message to node E, and then node E replies to B. Assume all ARP and Switch tables are empty at the beginning. Fill out the following table to show what will be stored at each switch at each step. Note: at each step, a switch may learn and store one or no new entry. Some rows of the table may remain blank at the end. Figure out how many steps are required. If two broadcasts occur at the same time, you may name the steps as step-a and step-b, for instance step 4-a and 4-b. Note: at each step, a switch may learn and store one or no new entry in its table. You may not need all the given rows in the below table. Step A B 1 2 3 3 5 S 2 1 Sender Receivers S1 switch table Sender Receivers MAC Interface 1 S321 4 S N D 3 3 2 S2 switch table MAC Interface S4 E F G 3 S3 switch table MAC Interface 1 S5 2 3 H S4 switch table MAC Interface 4 S5 switch table MAC Interface