In the tower of hanoi problem, the state involves having three discs stacked on the left peg, with the middle and right pegs empty.

The tower of Hanoi problem is a mathematical problem, invented by the French mathematician Edouard Lucas in 1883. The initial state involves having three discs stacked on the left peg, with the middle and right pegs empty.

There can be also more then three discs. The discs are of different sizes and are in a neat stack in ascending order of size, the smallest on top and so making a conical shape.

The goal of the problem is to move the entire stack (all three discs) from one of the pegs and placing it on top of another peg, following several rules.

i cant see the graph

step-by-step explanation:

go on the tube you might find some information there