i knew in chegg i can post 2 questions each ones

3. Consider the following directed, weighted graph: 3 B 3 N A 6 8 3 1 2 4 E -9 (a) Calculate the shortest paths (Dijkstra's algorithm) from A to every other vertex. Show your steps in the table below. (2 points) Vertex Distance Path 0 B D E F 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) 3. Consider the following directed, weighted graph: B 3 2 A 6 D 8 3 2 1 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) Vertex Distance Path 0 A B D E F G