Answer and explain this question in details from Algorithm Design and Analysis class. Thanks

Question 4 Consider the following tree rooted at node a. Answer the following questions: (i)What is the parent of node a? (ii) What are the siblings of node b? (iii) What are the children of node a? (iv) What is the subtree rooted at node a? (v) What is the subtree rooted at node d? (vi) What are the ancestors of node i? (vii) What are the descendants of node b? (viii) What are the leaf nodes in the tree? (ix) What is the height of the above tree? (x) Is the above tree a binary tree? Question 5 (i)Find the number of connected components of an undirected graph that has n (ii) What is the time complexity (using big O-notation) for finding the connected (iii) Find the number of connected components of an undirected graph that has n nodes and one edge components in Question 5(i)? nodes and n(n-1)/2-1 edges, where n>2