Prove that each of following problems is in P by sketching a polynomial time algorithm that solves it. Briefly justify that your algorithm runs in polynomial.

(1) EASY-SOLUTION = {F | F is a formula in 3cnf which is satisfied by assigning the same truth value to all of its variables (i.e., all variables are true or all variables are false)}