if N and N$\text{'}$ are two modes of a game tree and a player with a choice at N can move to N$\text{'},$ then N and N$\text{'}$ are connected by an edge $($in our drawings, this edge is realized by a line segment$).$ Prove every game tree has exactly one more node than edge.