Problem for no.1: Assuming that a graph has 10 vertices - 6 vertices of degree 3, 2 vertices of degree 4, and 2 vertices of degree 2.

1) How many edges are there?

a.15

b.45

c.30

d.9

2) Using the concept of Euler Path, is it possible to trace the

given shape below without lifting your pen and without tracing over the same

segment twice?

\f\f\f\f