Consider an undirected graph of 10 nodes named 0 through 9, arranged in a line, as 0-1-2-3-4-5-6-7-8-9. That is, there is an edge i, i+1 for i=0,1,...,8, and no other edges. Apply the Girvan-Newman algorithm to answer the following questions.
1. (3 points) What is the maximum betweenness of any edge?
2. (1 point) Which edge(s) has/have this betweenness?
3. (3 points) What is the minimum betweenness of any edge?
4. (1 point) Which edge(s) has/have this betweenness?
5. (2 points) Now, consider another graph with 10 nodes O,1,...,9. This graph is a complete graph, i.e., there is an edge between every pair of nodes. What is the betweenness of the edge 3,7?