Instead of finding the shortest path between two nodes in a weighted, undirected graph, we want to find the longest path between two nodes. That is, the path between two nodes where each node is visited at most once (or not at all) with the largest sum of weights. One way to solve this problem is to change each weight w in the graph to -w (negate the weights), and then find the shortest path in the graph. i. Can Dijkstra's algorithm be used to find the shortest path on the graph with negated weights, and thus solve the longest path problem on the original graph? Explain your answer. ii. A friend claims that they found another algorithm to solve the longest path problem on a weighted, undirected graph. They also claim that it has the same worst-case time complexity as Dijkstra's algorithm. What is your opinion of their claim? Explain your answer.