Question 4 1 pts A visualization algorithm can only handle sparse networks. For which of the following networks we can use this algorithm? A complete network of 10 nodes A Network of 10 nodes with 40 links O A Network of 10 nodes and 8 links Question 5 1 pts In a project description, we are asked to represent high-degree nodes in red. Which message are we necessarily communicating? Connects two or more communities Has more in-coming links than out-going links Is the most important node in the network Has a lot of connections to other nodes Question 6 1 pts Identify the entity and relationship in the research collaboration network. Entity: topics, relationship: closeness O Entity: employees, relationship: co- workership Entity: articles, relationship: citation Entity: researchers, relationship: co- authorship Question 7 1 pts We are working with a large dataset of documents. Which of the following requires shape-coding for nodes? A word-document network, in which nodes are words and documents, and a link exists between a word and a document if it appears more than 10 times in that document A word co-occurrence network, where nodes are words, and two words are connected if they co-appear in more than 10 sentences in the dataset