Given a graph of friends who have different interests, determine which groups of friends have the most interests in common. Then use a little math to determine a value to return. The graph will be represented as a series of nodes numbered consecutively from 1 to friends_nodes. Friendships have evolved based on interests which will be represented as weights in the graph. Any members who share the same interest are said to be connected by that interest. Once the node pairs with the maximum number of shared interests are determined, multiply the friends_nodes of the resulting node pairs and return the maximal product. Example friends_nodes = 4 friends_edges = 5 friends from = [1, 1, 2, 2, 2] friends_to = [2, 2, 3, 3, 4) friends_weight = (2,3,1,3,4] From To и 1 3 1 2 2 1 2 3 3 IN 2 3 1 2 2 3 3 1 3 2 4 4 4 4 The graph shows the following connections: Weight (Interest) 1 2 Connectons 2,3 1,2 1,2,3 2,4 3 4 1 s friends_edges s min(200, (friends_nodes * (friends_nodes - 1))/2) • Node pair (2,4) shares only 1 interest (4) and node pair (1,3) shares 1 interest (3). • Node pair (1.2) shares 2 interests (interests 2 and 3) and node pair (2, 3) shares also 2 interests (interest 1 and 3). So, the maximum number of shared interests is 2. Multiply the friends_nodes of the resulting node pairs : 1 * 2 = 2 and *3 = 6. • The maximal product is 6. Function Description Complete the function maxShared in the editor below. maxShared has the following parameter(s): int friends_nodes: number of nodes int friends_from[friends_edges]: the first part of node pairs int friends_to[friends_edges): the other part of node pairs int friends_weight[friends_edges]: the interests of node pairs Returns: int: maximal integer product of all node pairs sharing the most interests. Constraints 2 s friends_nodes < 100 . . • 1 s friends_weight[i] < 100 1 s friends_from[i], friends_to[i] = friends_nodes • 1s friends_weight[i] = friends_edges friends_from[i] + friends_to[i] • Each pair of friends can be connected by zero or more interests. . Input Format for Custom Testing Input from stdin will be processed as follows and passed to the function. The first line contains two space-separated integers friends_nodes and friends_edges. Each of the next friends_edges lines contains three space- separated integers, friends_from[i], friends to[i] and friends_weight[i] where 0 si