2 2 a) (26 points) Execute the Dijkstra algorithm at node D for the network shown above by filling in the following table. In the table you need to give both the distance D(V) and the previous node plv). (Add the nodes with the equal D(V) value to N'according to their alphabetical ascending order.) b) Explain how you calculated the entries in step 3. (It is necessary for getting point from a).) c) (6 points) Show the shortest path from the node D to the node E using the following table below. Explain your solution