Let P(x) be the statement "x can speak Russian, and let 17. Suppos Q(x) be the statement "x knows the computer language C++." Express each of these sentences in terms of P(x), Q(x), quantifiers, and logical connectives. The domain P(x) each c tions for quantifiers consists of all students at your school. a) There is a student at your school who can speak Rus- b) There is a student at your school who can speak Rus- e) Every student at your school either can speak Russian d) No student at your school can speak Russian or knows sian and who knows C++. sian but who doesn't know C++ or knows C++. a) 3u d) V 18. Supp P(x) out e junc a) d)