Consider a rectangular field of dimensions ( n imes m ) containing certain punctured cells. The objective is to maximize the placement of domino dice (rectangles of size ( 1 imes 2 ) ), while ensuring that no domino overlays the punctured squares. Provide an algorithmic description for this task, along with its computational complexity.|

Consider a rectangular field of dimensions nm containing certain punctured cells. The objective is to maximize the placement of domino dice (rectangles of size 12 ), while ensuring that no domino overlays the punctured squares. Provide an algorithmic description for this task, along with its computational complexity.|