I need the answers for A, B, C, D Thank you

The Bellman-Ford algorithm is run on the following graph. The start vertex is D. Assume each loop of the algorithm visits vertices in the graph in the following order: A, B, C, D. What are A's values after the first iteration? Enter inf for . What are B's values after the first iteration? What are C's values after the first iteration? What are D's values after the first iteration