Find the approximate solution for the set cover problem using the following data. Universal set U = { 1 , 2 , 3 , 4 , 5 , 6 } Subset S 1 = { 1 , 2 } , cost = 10 Subset S 2 = { 3 , 4 , 5 } , cost = 5 Subset S 3 = { 1 , 2 , 3 } , cost = 9 Page 2 of 3 Subset S 4 = { 6 } , cost = 1 Is the optimum solution different than approximate solution for this problem? Justify your answer..