Design as algorithm so that it converts a 3-CNF-formula O with m clauses over n variables into an instance of Hitting Set with

1) The universe that has 2n elements (one for each literal in o)

2) The collection that contains exactly m + n sets. Moreover n sets in the collection contain exactly 2 elements

3) The requested size of the actual hitting set in this n. Show that 3- SAT less than or equal to p Hitting Set