For problems 32 to 35, please consider a graph with /VI vertices and |E] edges, to which the Dijkstra algorithm is applied to findthe shortest path. Assume |E| is both O(|V|2) and Ω(|V|).
32. If Dijkstra algorithm is implemented with Binomial heap as priority qucue, then the complexity is
(A) O(|V|2+|E| log|V|)
(B) O(|V|2)
(C) O(|E| log|V|)
(D) O(|E| ||+|V| log|V|)
(E) O(|E|)