Solve for c and d please.

You are building a spanning tree with a breadth$-$first search using alphabetical order to break ties.

Use $a$ as your root.

Your answers should be comma seperated lists in alphabetical order.

In your spanning tree,

a$)$ The leaves are

b$)$ The children of a are

c$)$ The children of $d$ are

d$)$ The children of $h$ are

e$)$ The children of $g$ are