Instructions below, the example mentioned below that. Thanks for the help!

You can do this assignment in any language you prefer (eg Java, C++, C#, Python, etc.). This program will print to the console the resulting checkerboard in Example 14, Chapter 5.1 of your book. Example 14, Chapter 5.1 in your book proves that every 24n in 2n checkerboard with one square removed can be tiled using right triominoes. We also saw a proof of this in class. In this programming assignment, you will write a program to show this. In other words, when your program runs, it receives n as input, and prints to the console the checkerboard and the placement of the triominoes. When you run your program, it will ask for n. Once n is entered, the program prints the 2 in 2An checkerboard with the right placement of the triominoes to the console. You should first randomly remove one square from the board, i.e. mark it with "0". This square can be anywhere in the 2An in 2An checkerboard. Use the following numbers for the triominoes (use "O" for the removed square): You can do this assignment in any language you prefer (eg Java, C++, C#, Python, etc.). This program will print to the console the resulting checkerboard in Example 14, Chapter 5.1 of your book. Example 14, Chapter 5.1 in your book proves that every 24n in 2n checkerboard with one square removed can be tiled using right triominoes. We also saw a proof of this in class. In this programming assignment, you will write a program to show this. In other words, when your program runs, it receives n as input, and prints to the console the checkerboard and the placement of the triominoes. When you run your program, it will ask for n. Once n is entered, the program prints the 2 in 2An checkerboard with the right placement of the triominoes to the console. You should first randomly remove one square from the board, i.e. mark it with "0". This square can be anywhere in the 2An in 2An checkerboard. Use the following numbers for the triominoes (use "O" for the removed square)