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)