In the hitting set problem, we are given a family of finite integer sets {s1, s2, . . , sn} and a budget b, and we wish to find an integer set h of size ≤ b which intersects every si , if such an h exists. in other words, we want h ∩ si 6= ∅ for all i. show that the hitting set problem is np-complete.

The square pyramid has a volume of 441 cubic inches. what is the value of x? 1/7x is the height x is the base

What is the best name for the part of the figure identified by the arrow? line of reflection o line of symmetry plane of reflection o axis of symmetry

Scenario: susan wants to make 2 square flags to sell at a crafts fair. the fabric she wants to buy is 3 meters wide. she doesn't want any fabric left over. what's the least amount of fabric she should buy? question: which equation will susan solve her problem? note: let x represent the length of 1 side of the flag. options: 1) 3x^2 -2x =0 2) 2x^2 =3x 3) 2 * 2 = 2 * 2 4) 6 +2x = 2(4x)