In each of BFS, DFS, and Dijkstra\'s algorithm, there is an outer while-loop iterating over a queue, and an inner for-loop iterating over adjacent vertices. There are at most |V| elements in the queue and every vertex has at most |V|-1 adjacent vertices. Using an analysis of these nested loops, they would have an O(|V|^2) runtime bound, however using aggregate analysis, these loops have an O(|E|) runtime bound.Explain why we use aggregate analysis for these algorithmsinstead of a loop analysis.