Design the map and reduce functions to obtain a list of common friends for each pair of friends. That is$,$for each two people that are friends $($assuming friendship is bi$-$directional$),$you need to find the friends in common. As input, you receive a file that contains a list of friends for each person. Using map and reduce functions, you should find for each pair of friends, the list of common friends