In graph theory, answer this question with clear handwriting and explanation

mine whether the following graphs have an Eurlerian circuit, trail, 3. or neither. If they do, find it; if not use an appropriate theorem to prove this. (a Me