Suppose a social network, N, contains n people, m edges, and c connected components. What is the exact number of times that each of the methods, makeSet, union, and find, are called in computing the connected components for N using Algorithm 7.2.1? answers should be very clear, in proper order, and use complete sentences, and If pseudocode is required, the format must be the standard textbook pseudocode format. 

Algorithm UFConnected Components(S,E): Input: A set, S, of n people and a set, E, of m pairs of people from S' defining pairwise relationships Output: An identification, for each 2 in S, of the connected component con- taining r for each r in S do makeSet(x) for each (x, y) in E do if find() find (y) then union(find(), find(y)) for each r in S do Output "Person z belongs to connected component" find(+) Algorithm 7.2: A connected components algorithm using union and find.