In class, we discussed the fact that a tree$-$based Depth$-$First Search $($DFS$)$ is neither optimal nor complete. What are the advantages of using a tree$-$based DFS over graph$-$based DFS$?$

$($select all that apply$)$