This answer was a 7/10

Starting at vertex B, what is the order in which the vertices will be visited in a Breadth-First-Search. When inserting a group into the Queue, assume they are inserted in alphabetical order. \begin{tabular}{|l|l|l|} \hline 1 st & B \\ \hline 2nd & E \\ \hline 3rd & J \\ \hline 4 th & M \\ \hline 5 th & A \\ \hline 6 th & H \\ \hline 7 th & L \\ \hline 8 th & F \\ \hline 9 th & C \\ \hline 10 th & D \\ \hline 11 th & K \\ \hline 1 th & I \\ \hline 13 th & G \\ \hline 14 th & N \\ \hline \end{tabular}