Graph $G$ has vertices $1, 2, 3, 4, 5, 6, 7, 8$, and all edges connect two distinct vertices that have a divisor or multiple relationship. How many vertices in graph $G$ have degree 3? [3 points] (1) 1 (2) 2 (3) 3 (4) 4 (5) 5
Graph $G$ has vertices $1, 2, 3, 4, 5, 6, 7, 8$, and all edges connect two distinct vertices that have a divisor or multiple relationship. How many vertices in graph $G$ have degree 3? [3 points]\\
(1) 1\\
(2) 2\\
(3) 3\\
(4) 4\\
(5) 5