What is the time complexity of the DAG algorithm for Shortest Paths?

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

Question $47$Select one:

a$.$

$\backslash$Theta $()$

b$.$

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

c$.$

$\backslash$Theta $()$

d$.$

$\backslash$Theta $()$

e$.$

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