1GATE CSE 2013 | Question 19Graph AlgorithmsMCQ1 markWhat is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of nnn vertices?Single correctAΘ(n2)\Theta(n^2)Θ(n2)BΘ(n2logn)\Theta(n^2 \log n)Θ(n2logn)CΘ(n3)\Theta(n^3)Θ(n3)DΘ(n3logn)\Theta(n^3 \log n)Θ(n3logn) Answer key coming soon Show answer