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$)$

The following checkbox options contain math elements, so you may need to read them in your screen reader's $$reading$$ or $$browse$$ mode instead of $$forms$$ or $$focus$$ mode.

Choice $1$ of $4$:Tree$-$based searches require less storage space than graph$-$based

Choice $2$ of $4$:Tree$-$based searches are guaranteed to run faster than graph$-$based

Choice $3$ of $4$:Tree$-$based searches almost always find lower$-$cost solution paths than graph$-$based

Choice $4$ of $4$:Tree$-$based searches have constant $($

$$

$($

$1$

$)$

O$(1))$ space requirements rather than exponential