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