please help me with the following cs hw problem

At some time in our life, we are introduced to the game of dominoes. The term "domino" comes from the fact that the playing piece in the game has only two cells. Consider the next level of tromino: a playing piece that can contain three possible cells. Ignoring rotations and reflections, there are only two possible shapes a tromino can take: an "I" shape and an "L" shape.

Write a program in your favorite programming language that solves the following tiling problem: we have a game board that is an n by n array of unit squares where n 4 and is some positive power of 2. There is one randomly selected square that is a forbidden square; i.e., no tromino can be placed in that square. Write a program that will output a tiling of the array that satisfies the following conditions:

Every unit square other than the forbidden square is covered by a tromnio.

No tromnio covers the forbidden square.

No two tromnios overlap.

No tromnio extends beyond the board.