A rooted tree is a tree T where one vertex has been distinguished and called the root. A root vertex is written as a square, not a circle. So the following tree has root v = 4: 5 2 3 (a) List all rooted trees with V = [3]. (b) Prove that the number of rooted trees with V = [n] is n-1.