Prove or disprove: (a) All graphs with scores (0, 1,1, 1, 1) are isomorphic. (b) All graphs with scores (3,3, 4,4, 4) are isomorphic. (c) All graphs with scores (2, 2,2, 3,3) are isomorphic (d) All 3-regular graphs1 are isomorphic. lar graph of size n 100 has at least two connected components (0) Any graph that does not contain a triangle (a clique of size 3) is bipartite Prove or disprove: (a) All graphs with scores (0, 1,1, 1, 1) are isomorphic. (b) All graphs with scores (3,3, 4,4, 4) are isomorphic. (c) All graphs with scores (2, 2,2, 3,3) are isomorphic (d) All 3-regular graphs1 are isomorphic. lar graph of size n 100 has at least two connected components (0) Any graph that does not contain a triangle (a clique of size 3) is bipartite