$31\mathrm{.}3$ Project $3$: SNA $-$ due $12/3/2023$ Summary Create a C$++$ program that will read in the text file containing graph specifications and display the required results after performing operations on the graph. The program should be able to create the directed graph from the input file and output the results according to the In$-$Degree of Centrality. Social Network Analysis and Common Metrics As social networking is very popular among people, there is a huge interest in the study of extracting information from these networks, the so$-$called social network analysis $($SNA$).$ The usage of social network analysis, however, is far beyond that of Facebook or Twitter. The principle of SNA can be applied to other things; such as$,$ finding the source and flow of an infectious disease, and scheduling the optimal production$-$ market distribution for a globalized company. The basic structure of SNA is a graph. To evaluate the characteristics of a graph and the nodes inside, people gradually develop a set of metrics, some of them are: Degree of Centrality In an undirected graph, the degree centrality of the ith node $($denoted by C$\_$D$($i$))$ is the node degree $($number of edges connected to this node$),$ denoted by deg$($i$)$ C$\_($D$)($i$)=$deg$($i$)$ We can interpret this as the "how connected" this node is in general sense. In a directed graph, the in$-$degree of centrality comes in two types: the in$-$degree centrality and the out$-$degree centrality. The in$-$degree centrality is number of edges that are coming to the node. The out$-$degree centrality uses the number of edges that are coming out of the node. Dataset Description: Social network Accounts and their friends You will be provided with the accounts with their friends and for each friend his$/$hers friends etc. By using these data, build up a graph and calculate the In$-$Degree of Centrality for each account. Input data format A sample of the input data is: github john$\_$stewart github microsoft microsoft oracle The two columns are defining the relationship between two accounts. The account in the second column is following the account in the first column. Thus, this is a directed graph. The edge goes from the account in the second column to the account