Problem D-1. Prove Observation (1).
Problem D-2. Prove Observation (2).
Problem D-3. Prove Observation (3).
Problem D-4. Prove Observation (4).
Problem D-5. Prove Observation (5).
Problem
D-6. Show the set of all finite trees, as undirected graphs, is a
well partially ordered set when partially ordered by embedding.