urgent solution needed using c++

3. You work for Meta as a data scientist. You are given information about people and their friendship connection in the form of a graph for UIU students. Your job is to detect the number of group the network has, print the member id of the each of the group and then print the minimum number of connections required to combine all the separate groups. [9] The first two lines represent the number of people and the number of connections that exist between the people. The rest of the 8 lines represent the connection between the people. Each of the numbers from 0 to 1 represent the person's id. For example 01 in the third line means that the person with id 0 and id 1 are friends. [Hint: Use Disjoint Sets]