Consider a 2^n x 2^n board missing one cell. We want to cover this board with (4^n-1)/3 tiles. The tiles are L-shaped and consist of three adjacent cells. We are given the location of the missing cell as input. Design a divide-and-conquer algorithm that achieves this task.