"Computer Algorithm"

Consider the following data collected from you facebook site. You have just made a post. The post received 10 likes by people (1, 2, 3, profile of the people who liked this post and found the following info 10). You checked the 1 is a friend with all others 2 is a friend of 1, 3, 5, 7, 8 3 is a friend of 1, 2, and 5 4 is a friend of 1, 5, and 6 5 is a friend of 1, 2, 3 and 4 6 is a friend of 1 and 4 7 is a friend of 1, 2,8,9, and 10 8 is a friend of 1, 2, and 7 9 is a friend of 1 and 7 10 is a friend of 1 and 7 You also found that the group of 10 have the following in common: 1, 2, 3 and 4 are members of page x 1, 2, 5, 6, 7 are members of page y 1, 4, 7, 8, 9,10 are members of page z 1, 3, 6,10 are members of page w Q1. Construct a graph showing the relationships between the 10 members Q2. Apply a weight to the edges of the graph Q3. Find all the cliques in the graph Q4. If the edge with the weight requires 8 bytes of memory storage, find the total storage required to store the graph Q5. What is the largest degree of the graph, and which node has that degree Q6. What is the average degree of the graph. Q7. Show the minimum number of links which must be removed for the graph to be disconnected