Consider a 2n × 2n board missing one cell. We want to cover this board with (4n-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. (describing the algorithm with words is enough)