d 6 3 8 a 2 2 7 5 e Write down explicitly the steps of Dijkstra’s algorithm (the version in the lecture slides) by completing the tables below at each iteration of the algorithm (notation as in the...

Hi, this picture is the homework I have and it was on this site so I paid to see the answers, but it only answered question a. Can you show me how to solve the rest of the tasks?

Extracted text: d 6 3 8 a 2 2 7 5 e Write down explicitly the steps of Dijkstra’s algorithm (the version in the lecture slides) by completing the tables below at each iteration of the algorithm (notation as in the lecture slides). Iteration S N(S) {b} 1 {a,b,c, d,e,z} n Here S is the subset of vertices whose shortest path length from vertex b has been deter- mined, and N(S) is the neighbourhood of S. Iterations v L(v) L(v) L(v) a b d e Z. Here L(v) is the current shortest path length from vertex b to vertex v and =' means the vertex has not been considered yet.