- Can you find an assignation of friendship/un-friendship bonds in this network so that the network is structurally balanced? In other words, take each of the 17 bonds and assign a sign to it: (De Paul likes Messi so the bond DePaul Messi gets a (+) sign, etc.) - If so, show how you can clusterize the network for that particular assignation, in the sense of the Harary theorem. NOTE: Do not cheat !! Do not pick an assignation in which everybody likes everybody else. That is trivial. Do not pick an assignation with very few dislikes (for example there are several possibilities if you only include 2 dislikes and all the remaining 15 are likes). - Is there a structurally balanced assignation with 10(+) bonds and 7 (-) bonds? Or is that a violation of Harary?s theorem?. If there is one display it and show the corresponding clusterization of the network