Professor Sabatier conjectures the following converse of Theorem 23.1. Let G = (V, E) be a connected, undirected graph with a real-valued weight function w defined on E. Let A be a subset of E that is included in some minimum spanning tree for G, let (S, V – S) be any cut of G that respects A, and let (u, ν) be a safe edge for A crossing (S, V – S). Then, (u, ν) is a light edge for the cut. Show that the professor's conjecture is incorrect by giving a counterexample.