Please do not copy the EXACT same answer as:

https://www.chegg.com/homework-help/questions-and-answers/2-consider-total-union-problem-given-sets-u-s-s-set-subsets-u-find-smallest-subset-s-denot-q27524392

or

https://www.chegg.com/homework-help/questions-and-answers/consider-total-union-problem-given-sets-u-s-s-set-subsets-u-find-smallest-subset-s-denoted-q27653096?trackid=2ecd78af&strackid=4fbc9fb3&ii=9

2. Consider the Total-Union problem: given sets U and S, where S is a set of subsets of U, find a smallest subset of S, denoted by T, such that the union of all the elements of T equals U. It sounds more complicated than it is. Here's an example, let U a, b, c, d, e, f.g Ha, b, c, b, d,f.g, e,g, c, d,el, [e, f), a) S Then, T = {{a, b, c), {c, d, e), {f, g)) , since (a, b, c} U {c,d,e} Uf,g) = U and there does not exist a two element subset of S such that said subset is a total union Let Total Union = { |Over U and S There exists a total union of size k or less) Show that: Vertex Cover