The tables below show the values of predicates p(x, y), q(x, y), and s(x, y) for every possible combination of values of the variables x and y. the row number indicates the value for x and the column number indicates the value for y. the domain for x and y is {1, 2, 3}.

p 1 2 3
1 t f t
2 t f t
3 t t f
q 1 2 3
1 f f f
2 t t t
3 t f f
s 1 2 3
1 f f f
2 f f f
3 f f f
indicate whether each of the quantified statements is true or false.

(a)

∃x ∀y p(x, y)

(b)

∃x ∀y q(x, y)

(c)

∃x ∀y p(y, x)

(d)

∃x ∃y s(x, y)

(e)

∀x ∃y q(x, y)

(f)

∀x ∃y p(x, y)

(g)

∀x ∀y p(x, y)

(h)

∃x ∃y q(x, y)

(i)

∀x ∀y ¬s(x, y)

Print "censored" if userinput contains the word "darn", else print userinput. end with newline. ex: if userinput is "that darn cat.", then output is: censoredex: if userinput is "dang, that was scary! ", then output is: dang, that was scary! note: if the submitted code has an out-of-range access, the system will stop running the code after a few seconds, and report "program end never reached." the system doesn't print the test case that caused the reported message.#include #include using namespace std; int main() {string userinput; getline(cin, userinput); int ispresent = userinput.find("darn"); if (ispresent > 0){cout < < "censored" < < endl; /* your solution goes here */return 0; }