i need u to solve just part (d) please the answer should be step by step

2. Consider the following directed, weighted graph (CLO.4): B 2 2 3 7 D 12 N 2 1 E F -7 OS STARS CH MEU MIDDLE EAST UNIVERSITY Ammun. Jords (a) Calculate the shortest paths (Dijkstra's algorithm) from A to every other vertex. Show your steps in the table below. (3 points) Vertex Path Distance 0 B D E F G (b) Can Dijkstra's algorithm calculate the shortest path in part a) if no where exactly it fails? (1 points) (c) What single edge could be removed from the graph in such that Dijkstra's algorithm would work correctly? (1 points) (d) Calculate the shortest path for the above graph using Bellman-Ford Algorithm. (3 points)