Please use C++

Graph Data Structure Application Clique in community Explanation In the figure, it is seen who the numbered people follow on a social network such as Twither or lnstagram. This structure is a clique, that is, a sub-part of a community. This is a directional and costless graph (Directed and Weighted Graph). This data structure is located in the network tat file. Node (N) and edge (E) numbers are written in the frst two Ines, and who follows whom in the next E lines. Input File nebwork.tat. 10W N : Node number J E: edge ie follow number W Person 15 1 follows 2 12 19 82 Tasks 1. Read the graph from the network.bet file. Your codes should operate on a NaN matrix, and should be able to read up to E connections by itself. 2. Find Selfieh nodes i.e. people followed but unfollowed. Translated by Google 3. Find antisocial (desctive) people on Clique, ie neither followed nor unfollowed. 4. Find pairs of friends who follow esch other. 5. Transfer another script you developed to a file named Network2. tut and try your codes on it. In this scenario N>15 should be E>20