3. Graph parallel models] [30] This sets of questions relates to MR for graph processing Consider the common friends problem in problem 2.a. We study a "2-hop common contact problem", where a list should be returned for any pair of friends i and j, such that the list contains all the users that can reach both i and j within 2 hops. Write a MR algorithm to solve the problem and give the pseudo code a. We described how to compute distances with MapReduce. Consider a class of d- bounded reachability queries as follows. Given a graph G, two nodes u and v and an integer d, it returns a Boolean answer YES, if the two nodes in G can be connected by a path of length no greater than d. Otherwise, itreturns NO. Write a MR algorithm to compute the query G(u,v,d) and give the pseudo code. Providenecessary correctness and complexity analysis. b. 3. Graph parallel models] [30] This sets of questions relates to MR for graph processing Consider the common friends problem in problem 2.a. We study a "2-hop common contact problem", where a list should be returned for any pair of friends i and j, such that the list contains all the users that can reach both i and j within 2 hops. Write a MR algorithm to solve the problem and give the pseudo code a. We described how to compute distances with MapReduce. Consider a class of d- bounded reachability queries as follows. Given a graph G, two nodes u and v and an integer d, it returns a Boolean answer YES, if the two nodes in G can be connected by a path of length no greater than d. Otherwise, itreturns NO. Write a MR algorithm to compute the query G(u,v,d) and give the pseudo code. Providenecessary correctness and complexity analysis. b