2. In the problem of the cutting group (Hitting set problem), collection of groups F above V are iven to us. The goal is to find sub gorup VCC, with minimum size who cut(hitting) every group from F, formal: VSEF: CnS The group C, is called hitting set, or cover of F. Example: F= {{1,4,5), (1,2,3), (2,6,7), (1,3,7),(2,3,6,7}},V={1,2,3,4,5,6,7)}; C={1,6} or C={1,2} or etc... A. Formulate the problem as a problem of linear design in integers. B. Formulate the fractional version as a linear design problem. C. Write down the dual plan for the plan you received in the previous section. What problem does the dual program describe. D. 3. X and Y are possible solutions for linear program in a standard form. Her dual program is: