Consider the following recursive definition of a "rooted tree with root r": a single node r is a rooted tree with root r; if ,..., are rooted trees with roots T1,...,, and r is a single node, then r connected by edges to r1, ..., Tt is a rooted tree with root r. Prove by structural induction that any root tree x, if x has m nodes, then it has m - 1 edges. Xi tree A rooted tree with root r For the rooted trees x1 rooted trees. X tree X tree X+ tee .xt, they may or may not be single-node ...