Question 1: Let G be a bipartite graph of order 22 with partite sets U and W, where U=12. Suppose that every vertex in U has degree 3 ; while every vertex of W has degree 2 or 4 . How many vertices of G have degree 2 ? Question 2: Find order, size and the degree of each vertex in the given undirected graph and indegree \& out degree for directed graph. Question 3: Which of the following sequences are graphical? 1) S1:3,2,2,2,1 2) S2:3,2,1,1,1 3) S3: 5,5,4,3,3,2,1 Question 4: Find the cut vertices, cut edges, vertex connectivity and edge connectivity. Question 5: Draw graph represented by the given adjacency matrix. 11101002201112100130412130311010300240123