8.(20 points)Prove or disprove the following statements(a)If a connected simple graph has n vertices,then it has at least n-1 edges.(b)If a connected simple graph has n vertices,then it has at most n(n-1)edges.(c)K2.s is 5-edge-connected.(d)If two graphs have the same degree sequence then they are isomorphic.(e)The following two graphs are isomorphic.G2BPlease show details of your work to allow for possible partial credit.