answer the question

Autosave @ (A B o - b oSS P VLI AL R BRI Q Search (Cmd + Ctrl + U) Home Insert Draw Design Layout References Mailings Review View (J Comments / Editing v | (& Share v o vi2 v A A Ay | A AaBb(l czsbcenifl AaBb [l rosoccoae iR [j% @ & T 0 o e 5 A 2 AN : Heading 1 Heading 2 Subtitle SIS Dictate [ ET - h = Pane A clique is a group of vertices that are all connected to each other (e.g. a group of people who are all friends with each other). A k-clique in a graph is a clique with k people in it. How many 2-cliques are there in the above graph? How many 3-cliques? How many 4- cliques? 8. List 4 paths that go from vertex 1 to vertex 62 9. What is the length of the shortest path from vertex 1 to vertex 6? How many edges does it have? A graph with n vertices where every two vertices are connected to each other is called a fully connected graph. Also called a K_n (everyone's friends, in fact best friends) 10.Can you draw a K_5, a K_6? Think about how may edges do you need to draw for each. 11.In K_n, how many edges are there? Page20f5 507 words [OX English (United States) %'(Accessibilily: Investigate 2 Focus B