Write the code by C++

Problem statement: and some number of disks N of different sizes. To begin, the N disks are placed on the 1st column in order of their size, with the largest disk at the bottom of the column. The puzzle's goal is to finish with the disks arranged in the same order (biggest on the bottom, smallest on the top) on the 2nd column. Of course, you can't just move the disks however you want! You need to follow these rules You can only move one disk at a time by taking it off the top of its peg and putting it onto You're not allowed to place a disk on top of another disk that's smaller-that is, every disk must be smaller than every disk beneath it on the peg (5 pts) Implementation Statically Allocated 2-D array (2 pts) First, you can implement this is using a static 2-D array with 3 columns for the 3 posts and 3 rows, and you can initialize the array with the numbers 1,2, and 3 in the first column to represent the initial state of the game. The goal is to print out the board after each move in the game, seeing the following output. Example with two disks 1 0 0 2 0 0 2 0 1 0 2 1 0 1 0 0 2 0