$4$C$)$ Consider the extended LAN topology shown below, where B$1-$B$7$ represent bridges, with their

$(2)$

corresponding ports numbered.

We denote a configuration message from node X in which it claims to be distance d from root node Y as $(\backslash (\backslash$mathrm$\{$Y$\},\backslash$mathrm$\{$d$\},\backslash$mathrm$\{$X$\}\backslash )).$ For example, the first configuration message sent by bridge $\backslash (\backslash$mathrm$\{$B$7\}\backslash )$ is $($B$7,0,$ B$7).$ After the spanning tree algorithm converges, what are the configuration messages sent by bridge B$2,$ B$3$ and B$7,4$respectively?

Indicate which ports are deactivated by the spanning tree algorithm.