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^n in 2^n 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 2^n in 2^n checkerboard.You can do this assignment in any language you prefer (e.g. Java, C++, C#, Python, etc.).

For example, if the input to the program is n-3, this checkerboard is the solution: 4 41 14 4 22413 3 11 1 3 1 1 2013 3 3 1 222323 3 3 22 3 322 3 3 What to submit: Your source code. A screenshot of your checkerboard for n-5. Your program should work for any n up to n-10. There will also be demo with TA, where you show how you run your application, and how the checkerboard is printed