This is a subjective question, hence you have to write your answer in the Text-Field given below. Given an undirected graph, its degree sequence is the monotonic nonincreasing sequence of the degrees of the vertices of the graph. For example, the cycle C4 has the degree sequence 2, 2, 2, 2 and the wheel W4 has the degree sequence 4,3,3,3,3. (a). What is the degree sequence of the complete bipartite graph Km,n, where m and n are positive integers. Briefly justify. (b). Provide a counterexample to the following statement: [5 Marks] If two simple undirected graphs have the same degree sequence, then they are isomorphic. [20 Marks]