Computer Science Help Undirected Graph

Consider the following undirected graph, which is given in adjacency matrix form and where vertexes have character labels a integer weights (no value indicates no edge exists): A. List the node(s) that have a degree of 4. B. Trace Dijkstra's algorithm starting at node E by completing the table started below where each row represents one iter C. What is the shortest path from E to A? Give a list of vertexes starting at E and ending at A. D. What is the shortest path from E to G? Give a list of vertexes starting at E and ending at G