Additional Activities Awesome! Before we end this module, let me introduce a puzzle game called Tower of Hanoi. Are you familiar with this game? If not, allow me to introduce it to you. In the Tower of Hanoi puzzle a player attempts to move a large pile of disks, known as the Tower, from the leftmost peg to the rightmost on the puzzle board. The rules of the puzzle state that the player can only move one disk per turn and can never place a larger disk onto a smaller one at any time. Ion If you are interested to play the puzzle, you can search it on the internet. For the meantime, I just want to use the puzzle game for the purpose of applying sequences and generating patterns. Situation: In playing the game, you can choose the number of disks of your tower and play with the least possible moves. The least number of moves when playing the puzzle with respect to the number of disks are as follows: Number of Disks Number of Number of Moves Number of Disks Moves 31 3 63 7 127 15 255 Task: Based on the above data, find the general term in finding the number of moves with respect to the number of disks in playing the tower of Hanoi