Select the quantifier translation that best matches the following English statement. All computer scientists like pizza, and some computer scientists like soda, but no computer scientists like asparagus Let L(x, y) denote "x likes y", let C(x) denote "x is a computer scientist" and suppose the domain forx is all people. 2 4 13 14 15 16 Finish attempt... Select one: -3x |(C(x) -L(x, pizza)) (C(x) L(x, asparagus))| x (C(x) L(x, soda)) yx |C(x)-(L(x, pizza) -L(x, asparagus))| -wx (C(x) ^-L(x, soda)) (x) (L(x, pizza) -L(x, asparagus))) x (C(x) L(x, soda)) Vx (C(x) L(x, pizza) -L(x, asparagus)) 3x (C(x) L(x, soda) Check