Consider the following graph. While exploring it, assume alphabetical order, if needed. Starting from node A, apply the Dijkstra algorithm on the graph. Fill in the table below the graph. i. e., write the distance and predecessor that you found for each node.

Guidlines for entering your answers

• Nodes should be written as uppercase letters. If the node has no predecessor, NULL should be written instead "the four letters are all uppercase"
• Numbers should be written as integers

Consider the following graph. While exploring it, assume alphabetical order, if needed. Starting from node A, apply the Dijkstra algorithm on the graph. Fill in the table below the graph. i. e., write the distance and predecessor that you found for each node. Guidlines for entering your answers Nodes should be written as uppercase letters. If the node has no predecessor, NULL should be written instead "the four letters are all uppercase" Numbers should be written as integers 4 . B C 4 11. 11. 3 10 3 7 D U E G 5. 9 2 I J Fill in the following table Node Distance Predecessor A B C D E W ENG