F.1 ~ F.2 math (3)

In the Tower of Hanoi, we are given a tower of tower of three disks, initially stacked in increasing size on one of the three pegs. the objective is to transfer the entire tower to one of the other pegs, moving only one disk at a time and a smaller one onto a large one.

Suggest a way using minimum number of moves to accomplish the objective.

Hint : 1.Move disc1 to Peg C.
2. Move disc2 to Peg B.