(Solved): Work on the graph using Djikstra and the Bellman Ford algorithm to find the shortest path. Write it ...

Work on the graph using Djikstra and the Bellman Ford algorithm to find the shortest path. Write it on paper and scan it. 1. Does it work on Djikstra and Bellman? if not, Why? 2. If not, modify the graph/ the value (for example: cut the graph or change the value from - to +) for the graph can be solve with the two algorithms