In a simple Tower of Hanoi problem with 3 poles and 3 circular disks, what is the minimum number of moves required to transfer the disks to an empty peg?
a) 3
b) 6
c) 7
d) 8