(4%) Refer to the directed weighted graph below, and use the Bellman Ford's algorithm to find the shortest paths from node 0 to any other nodes in the graph. Which of the following statement(s) is(are) true?