Consider two graphs, G1 and G2, with the same number of nodes n (where n is very large). Given the facts that each node in G1 has at most 10 neighbors and each node in G2 has at least n/10 neighbors, which of the following is true? Select one: Both G1 and G2 are considered dense graphs Both G1 and 2 are considered sparse graphs O G1 is consered a sparse graph whereas G2 is considered a dense one G1 is ronsidered a dense graph whereas G2 is considered a sparse one In complete connected undirected graph, G=(V, E). if the sum of the gut-degrees of all verti