Let G be a graph with n vertices representing a set of gamers. There is an edge between two nodes if the corresponding gamers are friends. You want to partition the gamers into two disjoint groups...

Let G be a graph with n vertices representing a set of gamers. There is an edge between two nodes if the corresponding gamers are friends. You want to partition the gamers into two disjoint groups such that no two gamers in the same group are friends.

Is the problem in P or in NP?Give a formal proof for your answer. A 'Yes' or 'No' answer is not sufficient to get a non-zero mark on this question.