b The Bellman-Ford algorithm is applied to the following graph, with source vertex a. The order followed when looping through edges is a, b, c, d, e, where is the set of all edges from v to any other vertex. -3 a e 12 10 4 3 i) Why is Dijkstra's algorithm not appropriate for this graph? Describe the execution up to the first point at which the solution becomes incorrect. ii) Write out a table showing all changes to the shortest path estimate for each vertex during execution of the Bellman-Ford algorithm. iii) What would be the result of the Bellman-Ford algorithm if the weight of the edge (d, c) is changed to 1? The two parts carry, respectively, 55% and 45% of the marks.