In the following graph, determine the cost of the shortest path between node 1 and node 4. (Diagram: a diamond-shaped graph with 4 circular nodes…

In the following graph, determine the cost of the shortest path between node 1 and node 4.

(Diagram: a diamond-shaped graph with 4 circular nodes labeled 1 (top), 2 (right), 3 (left), 4 (bottom). Edges: 1–3 weight 2, 1–2 weight 3, 3–4 weight -7, 2–4 weight 1.)

1. a) 0
2. b) 4
3. c) -5
4. d) ∞