as we know a graph is bipartite if it can be divided into 2 set of vertices such that each edge in graph joins vertex of one part to vertex of another
let v1v2=a ,v1v3=b , v1v5=c ,v2v4=d ,v2v6=e ,v3v4=f, v3v7=g, v4v8=h ,v5v6=i ,v5v7=j , v6v8=k
option C is the ans since
edge a ,b,c,d, e, f, g, h, i, j, k will join vertex of left hand side to r.h.s
v1,v4,v6,v7 v2 , v3, v5, v8