5 points of a regular pentagon

[Natasha1]

Can anyone help me with this question please...

Five points form the vertices of a regular pentagon.

What is the shortest distance such that we can go from any of those five points to each of the four remaining points using the minimum amount of lines to join the points?

What about 6 points forming the vertices of a regular hexagon?

 

[daveb]

Well, your first trick is to determine the minimum amount of lines necessary to pass through each vertex, and it's not 5 (nor 6 for the hexagon).

 

[Natasha1]

Well, your first trick is to determine the minimum amount of lines necessary to pass through each vertex, and it's not 5 (nor 6 for the hexagon).

Do I need to add n-2 steiner points? i.e. 3 for the pentagon and 4 for the hexagon