Discrete Maths Thanks in advance. :)

In each case below, either draw a graph with the required properties, or prove that it doesn't exist (based on the results of Lecture/Workshop 9). (a) A tree on 7 vertices with degrees 1, 1, 1, 1, 1, 3, 4. (b) A tree on 6 vertices with degrees 1, 2, 2, 2, 3, 4. (c) A graph on six vertices with degrees 2, 2, 2, 2, 4, 4. (d) A graph on 4 vertices with degrees 3, 3, 3, 3. (e) A graph on 4 vertices with at least one cycle and with degree sum equal to 4 (f) A graph with 5 vertices and 4 edges that is not a tree