can someone help me with this problem computer science discrete math

Suppose the variable x represents racers, y represents cars, and T(x, y) means x has a y

Create an equivalent symbolic statement for each English statement:

Every racer has at least one car.

No racer has every car.

Some cars do not have racers