p2) I Need help with this Homework question

Please show details for better understanding

Thank you.

Problem 2. (simple) essentialay THe SaNity (Heck...). Let (nn) boolean symmeteic MatRiX AG with zero Diagonal be the adjacency matrix of an UNDIRECTED GRAPH G=V,E; CL(AG)=:maximum size OF cliques in this graph G. Prove that maxxi0,i=1nxi=1i=1nn(i,j)xixj1Cc(AG)1 Hint: Simple... youneed "Creatively" apply SOLUTION OF PROBLEM 1 OR Just THINK FOR 9 few minuTes Problem 2. (simple) essentialay THe SaNity (Heck...). Let (nn) boolean symmeteic MatRiX AG with zero Diagonal be the adjacency matrix of an UNDIRECTED GRAPH G=V,E; CL(AG)=:maximum size OF cliques in this graph G. Prove that maxxi0,i=1nxi=1i=1nn(i,j)xixj1Cc(AG)1 Hint: Simple... youneed "Creatively" apply SOLUTION OF PROBLEM 1 OR Just THINK FOR 9 few minuTes