Create a binary decision tree that determines which of the current US coins (penny, nickel, dime, quarter, half-dollar, and dollar) has been offered to a robot.
A matching in a graph G is a subgraph of G in which every vertex has degree 1. In other words, it's a pile of edges (with vertices included)-examples are shown in Figure 10.14. A perfect matching in a graph G is a matching that includes all of V(G).
