Problem 3. Let G=(V, E) be a weighted graph with exactly two negatively weighted edges and no negative cycle, and let s and t be two vertices in G. Describe and analyze an algorithm to find the shortest path from s to t in O(E+V log V) time. (Hint: Dijsktra works in O(E+V log V) time for a non-negatively weighted graph, and Bellman-Ford works in 0(EV) time for a graph that possibly has negative edges but no negative cycle.]