Question 9 Which of the following statements is correct about the simple shortest path problem? (Assume, for simplicity, that the graph is connected). O The problem is NP-hard if the graph contains a negative-length cycle. O The problem is ill-posed if the graph contains a negative-length cycle. O The problem is NP-hard if the graph contains arcs of negative length.
