4 a) Dijkstra's algorithm solves the SSSP problem. Describe how your choice of data structure to implement the Dijkstra's algorithm affects the time complexity of the algorithm.
5 marks
b) Apply the Dijkstra's algorithm to compute the shortest path from the source vertex S and comment whether it solves the SSSP problem. You should use the table below to
10 marks
update d[v] and T[v] for each vertex
r
2
2
3
X
-3
5
Z
y
You should show all your updates using the following table as you apply the algorithm
Vertex, v
[^]p
T[v]
S
r
x y z