Can i get help with this algorithm, not sure if i should use bellman ford or dijkstras

2. (4 marks) Select the most suitable algorithm from what we learned currently and run it on the following graph to find the shortest distance from the starting node A. What is the name of the most suitable algorithm? Draw a table showing the intermediate distance values of all the nodes at each iteration of the algorithms. a. b. c. Show the final shortest-path tree