The chromatic number of a graph is the smallest number of colors needed to color the vertices so that no two adjacent vertices share the same color.
Hence minimum number of colors needed to color given graph is equal to 3( option 2)
For odd length cycles we need minimum 3 colors for vertex coloring and for even length cycles we need just 2.