This prоblem is bаsed оn the fоllowing grаph: а) Write out both the adjacency matrix and adjacency list representations of this graph. Be sure to specify which is which. b) Suppose you are using Dijkstra’s algorithm to find the shortest path from node 3 to all other nodes. List, in the order in which they become known, all vertices to which a shortest path is determined in the process of solving this problem, the length of the shortest path to each of these vertices, and the cost update operations in each loop. The sample format is New node u added to S d(u) Cost updates for neighboring nodes