In each of the following questions, let graph G have eight vertices a, b, c, d, e, f, g, and h, and 13 edges ab, ad, af, ah, bc, be, bg, cd, ce, cg, df, eg, and fh.

1. List all maximal cliques in G (cliques that are not part of any larger clique).

2. What is the largest clique in G?

3. List all triangles in G.

4. What is the clustering coefficient of G?

5. What is the h-index of G?