4. Do the following problems:
Given a Rooted Tree T = <V, E>, with V = {a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u}, E
= {(a, b), (a, c), (a, d), (b, e), (b, f), (c, g), (c, h), (d, i), (d, j), (d, k), (f, l), (f, m), (f, n), (h, o), (h,
p), (i, q), (i, r), (q, s), (q, t), (t, u)}.
a. Draw the tree T.
b. Which node is the Root?.
c. Which nodes are internal nodes?
d. Which nodes are Leaves?
e. Which nodes are Children of j?
f. Which node is the Parent of h?
g. Which nodes are Siblings of o?
h. Which nodes are Ancestors of m?
i. Which nodes are Descendants of b?
j. Show a Depth First Search (DFS) traversal of T.
k. Show a Breadth First Search (BFS) traversal of T.