Consider the following graph and assume Dijkstra's algorithm is used to solve the single-source shortest path problem (the start vertex is A.) show all paths determined by the algorithm show the cost of the shortest path to reach every vertex While the algorithm is executed, the queue OPEN grows and shrinks. Show the status of the w queue when it has the maximum number of elements. With status of the queue it is meant the elements in the queue together with their priority values. In case the maximum size is reached multiple times, show the last one occurring