What is the time complexity of BFS and DFS in terms of the size of the graph? $($V

and $E$ refer to the number of vertices and Edges in the graph, respectively.$)$

a$.$ BFS has $O(V+E)$ and DFS has $O(V)$ time complexity

b$.$ Both have $O(V+E)$ time complexity

c$.$ Both have $O(V)$ time complexity

d$.$ BFS has $O(E)$ and DFS has $O(V)$ time complexity