What is the correct order for the following steps in the spanning$-$tree algorithm?

A: Elect a designated port for each segment.

B: Elect a root port for each nonroot switch.

C: Root ports and designated ports transition to the forwarding state.

D: Elect a root bridge.

Steps A$,$ C$,$ D$,$ B

Steps D$,$ C$,$ B$,$ A

Steps A$,$ C$,$ B$,$ D

Steps D$,$ B$,$ A$,$ C