Question $2$

In a graph with V vertices and E edges, if the graph is a tree $($acyclic and connected$),$ what is the time complexity of depth$-$first search $($DFS$)?$

$1$ point

O$($V$*$E$)$

O$($V$)$

O$($E$)$

O$($V$+$E$)$