Hello guys! So I started studying DS and Algos from where I left off, I kinda got stuck on a problem. Please I need someone to explain in plain "ENGLISH" what the author meant by the statements below. I suck at maths so please forgive my ignorance if any.

Q1. A polygon is a piecewise linear non-self-intersecting closed curve. We
consider modeling a polygon by its set of vertices (2D points stored in
an array) with a linked list of vertex indices (integers). Write a class
Polygon with a constructor that takes as its argument an array of 2D
points describing the cyclic sequence of vertices. The linked list shall be
bidirectional using the prev and succ fields.

Any help will be highly appreciated!