7. An open sentence over a domain may be defined using a verbally or symbolically expressed condition, but what it ultimately reduces to is a Boolean value ('true' or 'false') for each element of the sentence's domain. In this way, the table below, when filled in with 'T's and 'F's, will determine three open sentences P(n), Q(n) and R(n) over the domain {1,2}. n | P(n) | Q(n) | R(n) | If it is possible, create open sentences P(n), Q(n) and R(n) by filling in the table so that, for some choice of a, b and c from the domain both of the following are true: (P(a) Q(a)) A (Q(6) R(6)) A (R(C) PC)), and ~ (Q(a) = P(a))A ~ (R(6) = Q(6))~ (PC) = R(C). Exhibit the table which defines your sentences and your values for a, b and c (note that some repetition is inevitable because you are choosing three values from a two-element set). If this task is not possible, explain why this is so. 7. An open sentence over a domain may be defined using a verbally or symbolically expressed condition, but what it ultimately reduces to is a Boolean value ('true' or 'false') for each element of the sentence's domain. In this way, the table below, when filled in with 'T's and 'F's, will determine three open sentences P(n), Q(n) and R(n) over the domain {1,2}. n | P(n) | Q(n) | R(n) | If it is possible, create open sentences P(n), Q(n) and R(n) by filling in the table so that, for some choice of a, b and c from the domain both of the following are true: (P(a) Q(a)) A (Q(6) R(6)) A (R(C) PC)), and ~ (Q(a) = P(a))A ~ (R(6) = Q(6))~ (PC) = R(C). Exhibit the table which defines your sentences and your values for a, b and c (note that some repetition is inevitable because you are choosing three values from a two-element set). If this task is not possible, explain why this is so