This is a subjective question, rence you have to write your answer in the Text-Field given below. In the Girvan-Newman approach for community detection, one task that is repeatedly done is computing betweenness score for each edge. Recall that the betweenness score of an edge is the number of shortest paths that pass through this particular edge, with fractional credit assigned in case of multiple shortest paths some of which pass through the particular edge. Ignoring the edge weights in the graph shown in table Below, calculate the edge betweenness for edges (A-D) and (B-C). (10 marks) Edge Weight (A,B) 22 (A,C) 32 (A,D) 42 (A,E) 14 (B,C) 4 (B.D) 6 (B.E) 17 (C,D) 17 (DE) 10