Let x be a variable whose domain is ALL dogs. Express the following as a logical expression using a quantifier and a propositional function. Then form the negation of the statement so that no negation is to the left of the quantifier. Next, express the negation in simple English. (Do not simply use the phrase "It is not the case that"). All old dogs can learn new tricks. Let Olx) denotes x is an OLD dog (different from ALL dogs) and T(x) denotes x can learn new tricks. Provide the answers to the following: 1. Logical Expression using quantifier (All old dogs can learn new tricks): 2. Negation using quantifier (Express in symbolic propositional logic, NOT English): 3. Negation in simple English (Now express the negation in English terms): Question 9 2 pts Let P(x,y) be the statement "x/y = 1. If the domain for x and y consists of positive real numbers, determine whether the following expressions are True or False. State T for True and F for False. 1. VxVyP(x,y) 2. x]yP(x,y)