I am just looking for confirmation that I have performed djikstras algorithm correctly

2. The figure on the right shows a network cost of the link (a) With node B as the initial node, fill in the table below with Dijkstra's Algorithm. In the current" column, write your currently visited node in each iteration. In columns "A to "G with 7 nodes and 11 links. Number on each link is the write the currently lowest cost and the predecessor node. Draw the sink tree on the figure (or off the figure) based on your results iteration Current B CD EFG 2 8 5 4 (b) Draw the forwarding table and link state vector of node B (c) Somehow node E fails and shuts down. Which nodes have changed link state vectors due to this fail? Draw their new link state vectors. (d) Node E finally recovers and works properly. Now we want to create some hierarchies. Node A, C, F now belongs to region one. B and E are in region two. D and G are in region three. Please draw the new forwarding table of node B using hierarchical routing