Given the following directed, weighted graph: 4 Use the Bellman-Ford algorithm as demonstrated in the Content to determine the shortest path from vertex 1 to all other vertices, including the predecessor values. Remember that for each phase, assume the edges are examined in numeric order (1,1), (1, 2) The distance from vertex 1 to itself is O. Show the values in the Distance array D for the other three vertices (2, 3, and 4), after the first phase. Use F for infinity Distance[2] Distance[3] = Distance 4]- Using the same graph, algorithm, and answer notation as in the previnus nestion: Show the values in the Distance array D for the three vertices 2, 3, a after phase 2. Use F for infinity Distance[2] Distance[3] Distance 4 Using the same graph and algorithm as in the previous 2 questions: Show the Predecessor array P values for vertices 2 to 4, at the end of phase 2. If a vertex has no predecessor, mark it with 0 Predecessor[2] Predecessor[3] Predecessor[4]