Question: Let \[P(x)\] be the statement “x can speak Russian” and \[Q(x)\] be the statement “x knows the computer language C”. Express each of the following two sentences in terms of \[P(x),Q(x),\] quantifiers and logical connectives. The domain for quantifiers consists of all students at your school.

a.) Every student at your school can speak Russian and no student at your school knows the computer language C.

b.) Every student at your school who can speak Russian does not know the computer language C.

c.) No student at your school can both speak Russian and know the computer language C.

This problem is similar to P.47 #9.