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 u ? is the set of all edges from u to any other vertex b -3 4 -2 12 10 Why is Dijkstra's algorithm not appropriate for this graph? Describe the execution up to the first point at which the solution becomes incorrect. i) Write out a table showing all changes to the shortest path estimate for each vertex during execution of the Bellman-Ford algorithm. ii) What would be the result of the Bellman-Ford algorithm if the weight of the edge (d, c) is changed to 1? iii) The two parts carry, respectively, 55% and 45% of the marks