For the following four problems, please consider a graph with $|V|$ vertices and $|E|$ edges, to which the Dijkstra algorithm is applied to find the shortest path. Assume $|E|$ is both $O(|V|^2)$ and $\Omega(|V|)$.