Suppose that the universal address set address of a vertex v in an ordered rooted tree is 3.2.5.1.5. Find
(a) the level of v.
(b) the minimum number of siblings of v.
(c) the address of the parent of v.
(d) the minimum number of vertices in the tree.