HW HELP PLEASE!!!!

5) (25 pts) Step through Dijkstra's Algorithm to calculate the single source shortest path from node A to every other vertex. You must show your steps in the table below for full credit. Show your steps by crossing through values that are replaced by a new value. Break ties by choosing the lowest letter first; ex. if B and C were tied, you would explore B first. List the shortest path from A to E ? Is this the only path with the same distance? if not, list another solution