All information/ graphs are provided. no missing data is missing.

please look over provided screen shot of how the question is provided/ data is provided. no missing data is missing. please answer for only empty boxes.

Grave City is considering the relocation of several police substations to obtain better enforcement in high-crime areas. please look at screen shot for details on data/ question.

Grave City is considering the relocation of several police substations to obtain better enforcement in high-crime areas. The locations under consideration together with the areas that can be covered from these locations are given in the following table: Potential Locations for Areas Substations Covered A 1, 2, 5, 7 1, 3, 5 2, 4, 5 D 3, 4, 6 E 4, 5, 6 TI 1, 5, 6, 7 1, 5, 7 (a) Formulate an integer programming model that could be used to find the minimum number of locations necessary to provide coverage to all areas. If your answer is zero enter "0" and if the constant is "1" it must be entered in the box. Let M= I if a substation is located at she r Q otherwise Min XA + *B + xC + XD + XE + XF + *G s.t. XA + XB + xC + XD + XE + XF + xG - Select your answer - : (area 1 covered) XA + XB xC + XD + XE + XF + xG - Select your answer - (area 2 covered) XA + XB XC + XD+ XE + XF . *G - Select your answer - * (area 3 covered) XA + XB XD XE + xG - Select your answer - (area 4 covered XA + XB + XC+ XD4 XE + XF + *G - Select your answer - (area 5 covered) XA + xB + xC + XD + XE + XF + xG - Select your answer - (area 6 covered) XA + xB + XC + XD + XE + *F + *G - Select your answer - * (area 7 covered (b) Solve the problem in part (a). Choose the correct optimal solution. If your answer is zero enter "0" and if the constant is "1" it must be entered in the box. Locations for Substations Select ? A GT m DGrave City is considering the relocation of several police substations to obtain better enforcement in high-crime areas. The locations under consideration together with the areas that can be covered from these locations are given in the following table: Potential Locations for Areas Substations Covered A 1, 2, 5, 7 1, 3, 5 2, 4, 5 3, 4, 6 E 4, 5, 6 1, 5, 6, 7 1, 5, 7 (a) Formulate an integer programming model that could be used to find the minimum number of locations necessary to provide coverage to all areas. If your answer is zero enter "0" and if the constant is "1" it must be entered in the box. ! if a substation is located at she r Let M= 1 0otherwise Min XA + XB + xC + XD + *E + XF + XG s.t. XA + XB + xC + XD + XE + XF + xG - Select your answer - * (area 1 covered) XA + XB xC + XD + XE + XF + xG - Select your answer - (area 2 covered XA + XB + xC + XD + XE + XF+ *G - Select your answer (area 3 covered) XA + XB + xC + XD XE + XF + xG - Select your answer (area 4 covered) XA + XB + xC + XD + XE + XF + xG - Select your answer (area 5 covered) XA + XB + xC + XD + XE + XF + XG - Select your answer - (area 6 covered) XA + XB + XC + XD + XE + XF + xG - Select your answer - (area 7 covered) (b) Solve the problem in part (a). Choose the correct optimal solution. If your answer is zero enter "0" and if the constant is "1" it must be entered in the box. Locations for Substations Select ? A n mon