The Maximum-Disjoint-Subset problem is defined as follows: We are given a collection S of sets. We would like to find the maximum number of disjoint sets in S. (a) Formulate the decision version of the Maximum-Disjoint-Subset problem. (b) Prove that the decision version you formulated in (a) is NP-complete by reduction from 3-CNF-SAT.

answer: the answer is one of

step-by-step explanation:   we are given to write a proper fraction where the whole is divided into an even number of equal parts less than ten, and an odd number of those parts exist.

an even number less than 10 may be one of 2, 4, 6 or 8. so, the whole may be one of these four evens.

now, an odd number of these parts must exist, so the numerator must be an odd number, one of 1, 3, 5 or 7. it cannot be 9 because then the fraction will become improper.

thus, our fraction may be one of the following

the answer is (-4,-4)

hope this ! : d

step-by-step explanation:

the ratio of red paint to blue paint is always 9/7. that means that, whatever x's value, (4x+12)/(4x-4) has that same ratio. so, set up an equation and cross-multiply to solve for x:

9/7 = (4x+12)/(4x-4)

9(4x-4) = 7(4x+12)

36x - 36 = 28x + 84

8x - 36 = 84

8x = 120

x = 15