What is the time complexity of Dijkstra's algorithm for Shortest Paths?

Assume that inputs are positively weighted graphs G $=($V$,$E$).$

Select one:

$\backslash$Theta $($V $)$

$\backslash$Theta $($EV $)$

$\backslash$Theta $($V log V $)$

$\backslash$Theta $($E$)$

$\backslash$Theta $($E log V $)$