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.

(3) COMPLETE = {G | G is a complete graph (i.e., it contains a clique of size n where n is the number of nodes in the graph)}