4. Assuming a simple connected graph, consider the definition below Definition 1. A bipartite graph, also called a bigraph, is a set of graph vertices de- composed into two disjoint sets such that no two graph vertices within the same set are adjacent. A bipartite graph with m and n vertices in its partitions is denoted a Km,m (a) A bipartite graph that is maximal with respect to edges is said to be complete. Draw a complete K5,3 bipartite graph. [5 points] (b) Draw a connected K5,3 bipartite graph that is minimal with respect to edges. [5 points] (c) How many edges are there in a complete K, bipartite graph in terms of the size partition? What is the degree of each vertex in the partition? [10 points] (d) How many edges are there in a connected K, bipartite graph that is minimal with of the graph n, where n is a multiple of 3? What is the degree of each vertex in the respect to edges in terms of the size of the graph n, where n is a multiple of 3? [5 points]