The following network is like that of $2\mathrm{.}5\mathrm{.}1$ Example $1$: Switches Only, except that the switches are numbered differently. Again, the ID of switch Sn is n$,$ so S$1$ will be the root. Please follow the Spanning Tree Algorithm to present the step$-$by$-$step tree construction. $(5$ pts$)$ Which links end up $$pruned$$ by the spanning$-$tree algorithm, and why? $(3$ pts$)$