Consider the following algorithm for the set packing problem Let S S, S2 Sn be the input instance with SiC 11,2,... , m) Partition S- SUS2 where S1 S Sl m S and let R2 be the set having the maximum weight of sets in S2 . Return the better of R and R2 Show that 2Vm is a bound on the approximation ratio of this set packing algorithm. Consider the following algorithm for the set packing problem Let S S, S2 Sn be the input instance with SiC 11,2,... , m) Partition S- SUS2 where S1 S Sl m S and let R2 be the set having the maximum weight of sets in S2 . Return the better of R and R2 Show that 2Vm is a bound on the approximation ratio of this set packing algorithm