Given a graph G, check whether can we color the vertices of a graph G using two colors such that no two adjacent vertices have the same color. Which algorithm will you apply for this problem and what would be the complexity