We are given a n n board with one square colored black, all others colored white. Your task is to cover the board with L shaped tiles, such that all white squares are covered, the black square remains uncovered and there is no overlap among the L-shapes. An L-shape consists of three out of the 4 squares in a 22 square (thus one of the 2 2 = 4 squares is left uncovered by the shape). Design a divide-and-conquer algorithm to find a tiling of the board. Your algorithm will take as input the size n of one side(!) board and the position of the black square. You may assume that n 2 is a power of 2.