Consider a graph G that has a perfect matching. In general, we might expect that a maximum weight matching of G would be perfect. Show that this is not always true by constructing an example in which a maximum weight matching is not a perfect matching. (Hint: Try an example with four nodes.)