Company ABX is considering expansion in five business areas. To date, six service offers S1S6 have been identified to address the needs, R1 - R5, in the five business areas. Given the requirement-service matrix, determine the minimum cost service coverage of the five requirements (each requirement needs to be covered by at least one service). Apply the heuristic algorithm presented next to solve this problem. The Set Covering Heuristic Algorithm Step 1. Compute the ratio cj/ number of elements in column j, the unit coverage cost by service offer j. Step 2. Select column (not previously selected) with the minimum ratio cj/umber of elements in column jl. Step 3. Select another column with the minimum cj/| number of elements in column j and minimum overlap with the rows corresponding to the previously selected columns. Step 4. Repeat Step 3 until all rows are covered. If the final solution is not acceptable, go to Step 2