University of Washington Truth Table Problem Solving Questions

I’m working on a c++ multi-part question and need an explanation and answer to help me learn.

Solve the following problems :

a. Negate ∀n∃m(2m = n) and show it in a form that does not include the NOT operator.

b. Draw the truth table for (P && (P -> Q)) -> Q

c. Simplify the following code as much as possible:

if ((x >0 && x<y) || (x >0 && x >=y)) {

x=y;

}