Algorithms problem

Problem 4. Tiling 2"x2", and one square is reserved to be occupied by the statue of a wealthy donor. The location of the statue can be at any location (a, b) with 1 s a,b s 2" that the donor tells us. The rest of the squares are tiled by L-shaped pieces, each covering three squares. Here are two examples: . If n = 1, and (a, b) = (2,2), we could cover the floor using a single L-shaped piece: . If n = 2, and (a, b) = (1,4), we could cover the floor using five L-shaped tiles: 3 (a) Design a divide-and-conquer algorithm that takes as input the values n,a, b and outputs a list of the locations and orientations of (4"-1)/3 tiles.1 Give pseudocode for your algorithm. Solution: (b) Write a recurrence for the running time and solve it using any method that we've covered in class.2 Solution