Construct the ordered rooted tree whose preorder traversal is: a, b, f, c, g, h, i, d, e, j, k, l, - a has four children, - c has three children, - j has two children, - b and e have one child each, all other vertices are leaves.

Q15B. Consider the graph with the following vertices and edges: V = {a, b, c, d, e, f} E = {{a, b}, {a, e}, {b, c}, {b, f}, {d, e}, {e, f}} d a b D e (D Which of the following sets of edges represent subgraphs of the graph that are spanning trees? (Select all that apply.) {{a, b}, {a, e}, {b,c}} {{a, b}, {a, e}, {b,c}, {b, f}, {e, f}} {{a, b}, {b, c}, {d, e}, {e, f}} {{a, b}, {a, e}, {b, c}, {d, e}, {e, f}} C {{a, e}, {b, c}, {b, f}, {d, e}, {e, f}}

Please help me with these questions. I am having trouble understanding what to do Thank you

1. What is the largest n such that P₁, is a subgraph of K? 2. What is the largest n such that C₁ is a subgraph of K? 3. What is the largest n such that P₁ is an induced subgraph of K₁² 4. What is the largest n such that C₁ is an induced subgraph of K6?