Consider the following sequence of nodes for the undirected graph given below$:$
$(1)PQSTWVUR$
$(2)PQRSTUWV$
$(3)PQRTUSVW$
A Depth First Search (DFS) is started at node $P.$The nodes are listed in the order they are first visited.
Which all of the above are possible outputs$?$
$A)Only (2)$
$B)(1) and (2)$
$C)(2) and (3)$
$D)(1) and (2)$