Consider the given statements
S1: In a simple graph G with 6 vertices, if degree of each vertex is 2, then Euler circuit exists in G.
S2:In a simple graph G, if degree of each vertex is 3 then the graph G is connected.
Which of the following is/are true?