Assign weight of the edges of the following graph from the set of integers ranging from -10 to 10. [Ensure at least two edge's cost is negative]. Run the Bellman-Ford (two steps) shortest path algorithm on the following graph, starting from vertex A. Specifically, fill in the following table below according the steps of the algorithm. B A D Iteration/Vertex 0 A 0 B Infinity Infinity D Infinity E Infinity F Infinity 1 2