17. Consider the graph in Figure 1(b). Starting with node S, what is the order of the nodes
processed by the breadth-first search? If two or more nodes can be chosen, choose the
node with the smallest label first.
(A) S-C-A-M-R-H-P-B-D;
(B) S-C-M-A-H-B-P-R-D;
(C)
S-C-M-A-R-P-B-H-D;
(D) S-C-M-A-R-H-P-B-D.