<p><img alt="2. (10 points) Prove each of the following facts. You should not need to design any new constructions for these closure proofs: use results that we have already proved.
Be especially specific, impactful, and insightful.Will "paint" a picture of the place, issues, and solutions.Will be crystal clear with no need to double-back when reading to understand what's being said.Will
<p>Give an example of a directed graph G, edge weights w, and asource node, where there are no negative cycles and Dijkstra’salgorithm does not find shortest paths. Draw the example.</p>