Given a directed graph as an adjacency list (list of nodes which are targets of (out-)links): Ids -> list(Ids), determine the list of pairs (sn, cnt), such that cnt is the number of (in-)links incident on sn, using MapReduce paradigm. E.g., for the following graph, the expected pairs are (s1,1), (s2, 1), (s3,2), (s4,1). s1 : s2, s3. s2 : s1, s3, s4. Explain the map task and the reduce task, and define these functions using set or list notation.

Can u please every step in detail? If You cannot please don't ans the question