A graph G is said to be regular if every vertex has the same degree. If this 1 degree is equal to k, then G is k-regular. For example, K4 is 3-regular a) Draw a connected graph with exactly 5 vertices...

Discrete math. Graph theory. please answer (b)

Extracted text: A graph G is said to be regular if every vertex has the same degree. If this 1 degree is equal to k, then G is k-regular. For example, K4 is 3-regular a) Draw a connected graph with exactly 5 vertices that is 3-regular, or explain why this is not possible b) Draw a connected graph with exactly 8 vertices that is 3-regular, or explain why this is not possible