I need help with this integer problem, there is no missing part, this is all of the question.

A company has a series of pipelines laid under the factory floor. The floor consists of a series of heavy square slabs. It is desired to inspect each pipeline and this can be done if the company lifts at least one of the slabs directly above each pipeline. The layout of the slabs is as shown: 2 3 4 5 6 7 9 10 11 12 12 14 15 16 17 18 19 20 21 22 23 24 25 26 27 30 31 32 33 34 35 36 There is a pipeline under each one of the slab groups: {2,3,4); {7,16,17.18}; {10,11,12}, {13,14}; {25,34,33,32). When a slab is lifted it suffers damage, as do all other slabs that touch it, unless they touch diagonally. For example, if we lift slab 22, then slabs 22, 21, 13, 23, 31 are damaged. The company wishes to inspect all pipelines and minimize the total number of slabs that are damaged. Formulate this problem as an IP. Clearly explain the meaning of the con- straints. You must define all variables and the objective. As to the constraints, it suffices to write down explicitly some of them (i.e., a sample), and explain clearly how the others arise