Problem Solving

Q: A graph may be defined as a set of points connected by lines called edges.Every edge connects a pair of points.Thus a triangle is a graph with 3 edges and 3 points.The degree of a point is the number of edges connected to it.For example, a triangle is a graph with three points of degree 2 each. Consider a graph with 12 points.It is possible to reach any point from any other point through a sequence of edges.The number of edges 'e' in the graph must satisfy the condition :

a) 11<=e<=66

b)11<=e<=65

c)10<=e<=66

d)10<=e<=65

e)0<=e<=11



Note: The symbol<= mean less than or equal to.