The switch below has six nodes directly connected to it and a forwarding table that can hold ten entries. Suppose that node B sends $20$ frames to node C every second at a steady rate, and whenever C receives four of these frames, it sends a single frame in response. No frames are lost or corrupted and nodes D$,$ E and F are not communicating. Assume that node A is compromised, how many frames from B$$s communication with C can A eavesdrop? Explain why. Consider both directions of the communication, and assume the switch starts with an empty forwarding table $($Hint: consider what frames will be broadcast$).$ Problem $5$: LAN Switch $(10$pts$)$ The switch below has six nodes directly connected to it and a forwarding table that can hold ten entries. Suppose that node B sends $20$ frames to node C every second at a steady rate, and whenever C receives four of these frames, it sends a single frame in response. No frames are lost or corrupted and nodes D$,$ E and F are not communicating. Assume that node A is compromised, how many frames from B$\text{'}$s communication with C can A eavesdrop? Explain why. Consider both directions of the communication, and assume the switch starts with an empty forwarding table $($Hint: consider what frames will be broadcast$).$