please answer the 2nd part , thanks

Problem 2: We saw in class Dijkstra's algorithm is asymptotically faster than the Bellman-Ford algorithm to find shortest paths, but it requires all edges to be non-negative. . Show an example of a graph with some edges with negative weights where Dijkstra's algorithm fails to find a shortest path; Let G-(V, E) be a weighted graph with weight function w and some edges with negative weights. Let W be the minimum weight in the graph with w