What is the time complexity of Bellman$-$Ford algorithm for Shortest Paths?

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

Question $50$Select one:

a$.$

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

b$.$

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

c$.$

$\backslash$Theta $($VlogV$)$

d$.$

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

e$.$

$\backslash$Theta $($ElogV$)$