Consider a $2\backslash$times $2$ square with a single $1\backslash$times $1$ square removed $($anywhere in the big square$).$ Give a software algorithm for tiling the shape with $3-$square, L$-$shaped pieces $($i$.$e$.,2\backslash$times $2$ squares with a corner removed$),$ as a procedure that takes the size of the board and the coordinates of the removed square as input. What algorithm design strategy does your solution follow?