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.

solution:

→c= a b , that is product of a and b is possible only when when a is m × n matrix and b is n × p matrix.

that is, number of columns of a= number of rows of b.

so, size of matrix , c= a b is , if a = (m × n)matrix

b= (n × p)matrix

then a b = [ (m × n)matrix] ×[   (n × p)matrix ]

→→c= a b= [m × p ] matrix

→→size of product a b will be equal to = number of rows of a × number of columns of b

answer: y=4000x+14000

step-by-step explanation:

you already gave the answer

step-by-step explanation: