When a priority Queue $($binary heap$)$ is used, which of these is the time complexity of Dijkstra's algorithm? $n$ represents the number of vertices in the graph, while $E$ is the number of edges.

$O(E{n}^2)$

$O(E{n}^3)$

$O(E^{2}logn)$

$O(Elogn)$