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.LANGUAGE: C++CHECK THE IMAGE FOR FULL QUESTION