Here is a mathematical problem

can anybody write code to it in C/C++/JAVA/PYTHON

In a game of Tic Tac Toe

we call equivalent boards which may be obtained from other board by

rotating or flipping

a) how many non-equivalent boards are there

b) in a) if 3”X” and 3”O” are there

c) in a) if we count regardless that one has won the game i.e. we have

to fill all boxes.

In part a) you have to consider that you cannot fill more boxes after the

the game has a winner