Let x and y be two decision problems. suppose we know that x reduces to y. which of the following can we infer? explain

a. if y is np-complete then so is x.

b. if x is np-complete then so is y.

c. if y is np-complete and x is in np then x is np-complete.

d. if x is np-complete and y is in np then y is np-complete.

e. x and y can't both be np-complete.

f. if x is in p, then y is in p.

g. if y is in p, then x is in p.