Draw k3 count the number of vertices edges and faces how

Question

Question: 1. Go to https://planarity.net; enjoy.

2. Verify Euler's formula for K₄. (Be sure to draw K4 without edges crossing.)

3. Draw K3. Count the number of vertices, edges, and faces. How many edges must you remove to obtain a spanning tree? Do so. Count the number of vertices, edges, and faces of the spanning tree. Verify Euler's formula for K3 and for the spanning tree you obtained.

4. Verify Euler's formula for W₆, the wheel with five spokes.

5. Explain why every planar drawing of a graph has the same number of faces.