A graph is bipartite if its vertex set can be partitioned into two sets V₁ and V₂ such all edges are between V₁ and V2 (i.e. there are no edges joining vertices inside V₁, and the same for V2).
(a) Draw a bipartite graph with 5 vertices and 5 edges.