Question

I need help solving this

Answer 1

c. or b.

Answer 2

the answer is a

Answer 3

54 definetly

Answer 4

oh ok

Answer 5

Think of any vertex. It can't connect to itself, nor the two neighboring vertices already connected by edges, but that still leaves 9 vertices to connect to.

12 vertices each connected to 9 other vertices would seem to imply 108 diagonals... except you are double-counting everything (a diagonal from A to B is the same as a diagonal from B to A). So divide this number by 2.

Note: The general formula for the number of diagonals in an n-gon is:
n(n-3) / 2

Answer:
54 diagonals

Answer 6

Thanks