please help

find what you think is a good solution to the Block Tilings problem represented in

5

1 +

1 |

1 L

1 T

1 Z

1 4

You can draw a picture or use ASCII text Any method that makes it clear where you have placed each block is fine. Indicate how many grid spaces you had to leave blank in your solution.

Suppose you have an empty NxN grid, and some blocks that each have one of the 6 possible shapes shown above. For convenience, each different shape has a single character that represents it, as shown in the picture. You are allowed to place a block anywhere on the grid, so long as it fully fits and does not cover any portion of another block. You are NOT allowed to rotate the blocks. The goal is to cover as much of the grid as possible with the blocks. The order in which the blocks are placed does not matter, and it does not matter which blocks are used or if there are any blocks left over. Minimizing the number of empty grid spaces is all that counts. Data Files You will be given a series of data files representing Block Tiling problems. Each file represents a single problem. The following is an example that corresponds to the situation in the picture above. The 4 on line 1 specifies N, which is the dimension of the grid. Each subsequent line specifies the availabilty of a certain shape of block. For example, line 2 indicates that one +-shaped block is available, and line 3 indicates that one L-shaped block is available