3. What will be the summation of these combination numbers, 3? a where n C = j=0(-2)/( (-2) (1) 4. Consider complete graphs. 1. Draw complete graph k6 (graph with 6 vertices). 2. Determine number of edges in complete graph k10 (graph with 10 vertices). 6. whether the given graph (below) has an Euler circuit. Construct such a circuit when one exists. If no Euler circuit exists, determine whether the graph has an Euler path and construct such a path if one exists. 5. You have been given the following list of integers claiming it to represent degrees corresponding to all vertices of the graph. Comment on the existence of the graph with reasons. {3, 5, 1, 4, 2, 2} b d