Q$2$ Run time

$5$ Points

The running time of Dijkstra's algorithm is the following:

$O(n+m)$

$O(nlogn+m)$

$O(n+$mlogn$)$

$O((n+m)logn)$

$O(n^2+$mlogn$)$