1.6 Exercise Prove that any two nodes x and y in a rooted tree have a unique least common ancestor 2. This simply means that there is a path P1 from z to 1, and a path P2 from z to y, and that the only verter those two paths have in common is z. (And further, that there is exactly one node z with this property.)