this question comes from the final exam last year. but my teacher did not give the answer. anyone who can give me a hand. so so so so so so so so much thanks
![[2+12 14 marks] Two single-source shortest path algorithms, the Dijkstra algoritum and the Bellmane Ford algorithm, have been introduced in the course. In the following graph GIV,E) (G) to find a single-source shortest path from s to every other vertex in G, which of the two mentioned algorithms should be applied, and why? (2 marks) QUESTION 4ai) 2 marks i) Apply the algorithm you selected in Parti). Give the major intermediate results (ie, the result after each iteration that clearly indicates the d and π values of each vertex) and the final result. (12 marks) QUESTION 44aXii) (more room on next page) 12 marks]](https://media.cheggcdn.com/media%2F9fc%2F9fc658b3-d55d-4eaa-ae10-36b4db95cbcd%2FphpSS4t6N.png)
[2+12 14 marks] Two single-source shortest path algorithms, the Dijkstra algoritum and the Bellmane Ford algorithm, have been introduced in the course. In the following graph GIV,E) (G) to find a single-source shortest path from s to every other vertex in G, which of the two mentioned algorithms should be applied, and why? (2 marks) QUESTION 4ai) 2 marks i) Apply the algorithm you selected in Parti). Give the major intermediate results (ie, the result after each iteration that clearly indicates the d and π values of each vertex) and the final result. (12 marks) QUESTION 44aXii) (more room on next page) 12 marks]
