need in C++...asap Given a graph of friends who have different interests, determinewhich groups of friends have the most interests in common. ThenExplanation 0Node pair (2,4) shares only 1 interest (4) and node pair (1,3) shares 1interest (3).v Input Format for Custom Testinguse a little math to determine a value to return.• 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 maximumEach pair offriends_nodes = 4friends is connected bythe following interests:Input from stdin will be processed as follows and passed to thefunction.The graph will be represented as a series of nodes numberedconsecutively from 1 to friends_nodes. Friendships have evolvedbased on interests which will be represented as weights in thegraph. Any members who share the same interest are said to beconnected by that interest. Once the node pairs with the maximumnumber of shared interests are determined, multiply thefriends_nodes of the resulting node pairs and return the maximalproduct.number of shared interests is 2.• Multiply the friends_nodes of the resulting node pairs : 1 x 2 =2 and .x 3 = 6.The first line contains two space-separated integers friends_nodesand friends_edges.Each of the next friends edges lines contains three space-separated integers, friends_from[i), friends_to[i] andfriends_weight[i] where 0si

Question

need in C++...asap Given a graph of friends who have different interests, determinewhich groups of friends have the most interests in common. ThenExplanation 0Node pair (2,4) shares only 1 interest (4) and node pair (1,3) shares 1interest (3).v Input Format for Custom Testinguse a little math to determine a value to return.• 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 maximumEach pair offriends_nodes = 4friends is connected bythe following interests:Input from stdin will be processed as follows and passed to thefunction.The graph will be represented as a series of nodes numberedconsecutively from 1 to friends_nodes. Friendships have evolvedbased on interests which will be represented as weights in thegraph. Any members who share the same interest are said to beconnected by that interest. Once the node pairs with the maximumnumber of shared interests are determined, multiply thefriends_nodes of the resulting node pairs and return the maximalproduct.number of shared interests is 2.• Multiply the friends_nodes of the resulting node pairs : 1 x 2 =2 and .x 3 = 6.The first line contains two space-separated integers friends_nodesand friends_edges.Each of the next friends edges lines contains three space-separated integers, friends_from[i), friends_to[i] andfriends_weight[i] where 0si< friends_edges.• The maximal product is 6.Function DescriptionPair (1, 2) shares 2Complete the function maxShared in the editor below.interests (i.e.,(2)Exampleinterests 1 and 2)friends_nodes = 4v Sample Case 0maxShared has the following parameter(s):3friends_edges = 5friends_from = [1, 1, 2, 2, 2]friends to = [2, 2, 3, 3, 4]friends_weight = [2, 3, 1, 3, 4]Pair (1, 3) shares 1int friends_nodes: number of nodesinterest (i.e., interestint friends_from[friends_edges]: the first part of node pairsint friends to[friends_edges]: the other part of node pairsint friends_weight[friends_edges]: the interests of node pairsSample Input 01)STDINFunctionPair (1, 4) shares 01FromToReturns:interests245friends_nodes = 4friends_edges = 5The pairs connected by themaximal number of interests are3int: maximal integer product of all node pairs sharing the mostPair (2, 3) shares 2interests.1 2 1friends from = [1,1,2,2,2] friends to = [23interests (i.e.,231 2 22 3 1(1, 2) and (2, 3). Their respectiveproducts are 1 x 2 = 2 and 2 x 3 =6. The result is the the largest of44interests 1 and 3)Constraints2 33Pair (2, 4) shares 1• 2s friends_nodes s 1002 4 3interest (i.e., interestThe graph shows the following connections:• 1 friends_edges s min(200, (friends_nodes x (friends_nodes - 1)) athese values which is 6.3)1 s friends_weight[i] s 100• 1 s friends_from[i], friends_to[i] s friends_nodes• 1s friends_weight[i] s friends_edges• friends_from[i] # friends_to[i]Weight(Interest)Pair (3, 4) shares 1ConnectonsSample Output 02,3interest (i.e., interest21,23)1,2,3• Each pair of friends can be connected by zero or more interests.42,42.

Accepted Answer

Coded using C++.