4. Identify all the 2-cliques (of at least 3 members) in the network. (This is harder, so take your time trying to find all. One strategy for finding some 2-cliques is to start with a clique and see how you can build out from it to create 2-cliques. That approach will not catch all of the six 2- cliques present in this network, because some 2-cliques do not include any clique, but it should give you a good start and make it easier to think about the remaining 2-cliques. Also remember that different 2-cliques can share many of their members, so more than one 2-clique might be found by building out from a clique.) 5. Identify any 3-clique in the network. (There are three of them here, and they greatly overlap, but you just need to find one of them.) 6. Identify the (maximal) 2-core in the network. (Use the strategy for reducing a component- or 1-core - to a 2-core that was discussed in lecture.) NOAH BENSON MAXWELL ABRAHAM HENRY STEPHEN DAMIAN ANDREW DONALD JACKSON LOTSON GODFREY JOSHUA ABEL SOFT