Let there be a regular polygon of n sides with center O. Determine the highest possible number of vertices k (k≥3), which can be coloured in green, such that O is strictly outside of any triangle with 3 vertices coloured green. Determine this k for a)n=2019 ; b)n=2020. combinatoricsregular polygon