Which property of a cryptographic hash function means it should be computationally infeasible to find two different inputs that produce the same hash output?

Why A is correct

Collision resistance means it should be computationally infeasible to find any two different inputs x and y where H(x) = H(y). Pre-image resistance means given a hash h, it's hard to find any input x where H(x) = h. Second pre-image resistance means given x, it's hard to find y ≠ x where H(x) = H(y).