Huntruh9076 Huntruh9076 17-06-2024 Mathematics Answered What is the time complexity of Dijkstra's algorithm for Shortest Paths? Assume that inputs are positively weighted graphs G = (V,E).A. θ(V)B. θ(EV)C. θ(V log V)D. θ(E)E. θ(E log V)