How to prove 3CLIQUE is decidable

From our computational complexity, there's a question asking to prove 3CLIQUE is decidable.

The definition of 3CLIQUE is:
$$\{(V,E) : G = (V,E)\text{ is an undirected graph that contains a clique of size 3}\}.$$

I know this is an NP problem, and NP is a set of problems that easy to verify but hard to solve, but I don't know how to prove. Is there anyone who can help me on this?

• Is the question to show decidability, or to show that it's efficiently decidable? – templatetypedef Dec 3 '16 at 1:59
• "NP is a set of problems that easy to verify but hard to solve" -- wrong. NP includes many problems that are easy to solve. – Raphael Dec 3 '16 at 11:27
• What have you tried? Where did you get stuck? We do not want to just hand you the solution; we want you to gain understanding. However, as it is we do not know what your underlying problem is, so we can not begin to help. See here for tips on asking questions about exercise problems. If you are uncertain how to improve your question, why not ask around in Computer Science Chat? – Raphael Dec 3 '16 at 11:27
• Your question is a very basic one. Let me direct you towards our reference questions which cover some fundamentals you seem to be missing in detail. Please work through the related questions listed there, try to solve your problem again and edit to include your attempts along with the specific problems you encountered. Good luck! – Raphael Dec 3 '16 at 11:28

Your problem is in NP but it isn't NP-complete (unless P=NP), since it's also in P. That is, it can be solved in polynomial time. To prove this, you need to give a polynomial time algorithm that, given a graph $G=(V,E)$, determines whether it contains a clique of size 3. I trust that you are able to do it yourself.