Starting from node $\text{'}$B$\text{'},$ traverse this graph using Breadth$-$First Search $($BFS$).$

Record the order in which the nodes will be visited. In cases of multiple choices, select the nodes in alphabetical order $($i$.$e$.,$ ascending order$).$ Utilize a queue data structure and illustrate how the content of this queue changes step by step.