<h3>Question Description</h3> <p>View the Assignment 2 Overview to gain an understanding of the overall assignment requirements (Assignment 2.1 and 2.2), available topics for this assignment, and grading criteria.</p><p>To complete this
<p>Give an example of a weighted directed graph G withnegative-weight edges, but no negative-weight cycle, such thatDijkstra’s algorithm incorrectly computes the shortest-pathdistances from some vertex v. Trace the execution of