Consider a graph traversal algorithm with a time complexity of $O(V+E),$ where $V$ is the number of vertices and $E$ is the number of edges. If the graph is a complete graph with $V$ vertices, what is the time complexity in terms of $V$ alone?

$O(V)$

$O(2^{{?}^{{?}^{?}}}V)$

$O(V^{{?}^{{?}^{?}}}2)$

$O(VlogV)$