3. Consider the following directed, weighted graph: 3 B 3 2 6 A D 8 3 2. 1 4 E F (a) Calculate the shortest paths (Dijkstra's algorithm) from A to every other vertex. Show your steps in the table below. (2 points) Path Distance 0 Vertex A B D E G (b) Can Dijkstra's algorithm calculate the shortest path in part a) if no where exactly it fails? (2 points) (c) Calculate the shortest path for the above graph using Bellman-Ford Algorithm (show your answer). (2 points)