In each of 4—20, either draw a graph with the given specifications or explain why no such graph exists.

6. Full binary tree, seven vertices, of which four are internal vertices

Draw a graph with the given specifications or explain the reason if no such graph exists.

Given information:

Full binary tree, seven vertices, of which four are internal vertices.

Concept used:

If k is a positive integer and T is a full binary tree with k internal vertices, then T has a total of 2k+1 vertices and has k+1 terminal vertices.

Calculation:

For four internal vertices, we have

k=4