Solve the mutilated checkerboard problem using z3. You have an nxn checkerboard with two missing squares. You have dominoes that cover two horizontal or two vertical squares. You need to determine if you can cover all the squares without having two dominoes on the same square.

Turn in the z3 permalink, including comments and output description as in Assignment 1. The z3 code you need to turn in will attempt to solve the problem for a 4x4 checkerboard with positions (2,4) and (3,4) missing, and for a 4x4 checkerboard with positions (1,1) and (4,4) missing. So you will need two permalinks.