1 1 2 1 switch2 2 3 switch 6 3 switch1 2 3 4 Legend 100...

Transcribed Image Text:

1 1 2 1 switch2 2 3 switch 6 3 switch1 2 3 4 Legend 100 Mbps 10 Mbps Switch Number 12 2 2 switch4 3 6 switch9 3 switch7 5 4 5 4 3 is the BID 1 2 3 2 2 switch3 4 1 switch8 switch5 4 3 In the figure shown, determine the Spanning-Tree topology. Label the port types and port states when the topology has converged. Also calculate the Designated Cost for each segment and the Root Path Cost for each switch. Clearly show the converged logical topology in a separate drawing, and identify the root bridge. A copy of the Root Path Costs Switch # Root Port RPC Switch # Root Port RPC 1 ? ? 6 ? ? 2 ? ? 7 ? ? 3 ? ? 8 ? ? 4 ? ? 9 ? ? 5 ? ? 1 1 2 1 switch2 2 3 switch 6 3 switch1 2 3 4 Legend 100 Mbps 10 Mbps Switch Number 12 2 2 switch4 3 6 switch9 3 switch7 5 4 5 4 3 is the BID 1 2 3 2 2 switch3 4 1 switch8 switch5 4 3 In the figure shown, determine the Spanning-Tree topology. Label the port types and port states when the topology has converged. Also calculate the Designated Cost for each segment and the Root Path Cost for each switch. Clearly show the converged logical topology in a separate drawing, and identify the root bridge. A copy of the Root Path Costs Switch # Root Port RPC Switch # Root Port RPC 1 ? ? 6 ? ? 2 ? ? 7 ? ? 3 ? ? 8 ? ? 4 ? ? 9 ? ? 5 ? ?