Assume that you are going to conduct BFS $(=$ Breadth$-$First Search$)$ for the following graph from the vertex c$.$ Select the visiting sequence from the number $1$ to fill the mark array as you learned in the lecture. When you traverse the graph, you should follow our convention $(=$ alphabetical order of vertex characters$).$