3.(15%) Use an example to explain why Dijkstra's shortest path algorithm cannot be applied to graphs with negative edge weights. In your example graph, please highlight the source and the destination.