For problems 7 to 10, please consider a graph with IVI vertices and |E| edges, to which the Dijkstra algorithm is applied to find the shortest path. Assume |E| is both O(IV)2) and Ω(IV).
7. If Dijkstra algorithm is implemented with Binomial heap as priority qucue, then the complexity is
mplexity is
(A)O(IVI2+E log IVI)
(B)O(IVI2)
(C)O(IEl log IVI)
(D)O(|E|+|V| log|V|)
(E) O(|E|)