Write MapReduce algorithms

Write MapReduce algorithms for problems 4. and 5. For each, describe .(If not already specified) How the input should be represented as a file in HDFS . Pseudocode for the map method, including a specification of what is the key and value for the input, as well as the key and value for an output tuple. . Pseudocode for the reduce method, including a key and value specification similar to that for the map method. If a combiner is useful, then use it and specify the pseudocode for the combiner. .Suppose there were M mappers (map tasks) and R reducers (reduce tasks). Analyze the per-mapper CPU cost, per-reducer CPU cost, and the communication between mappers and reducers. If the computation involves more than one round, then do the analysis for each round. A directed graph G- (V,E) consists of a set of vertices V, and a set of edges E such that each element e in E is an ordered pair (u,v), denoting an edge directed from u to v. In a directed graph, a directed cycle of length three is a triple of vertices (x,y.z) such that each of (xy) (yz) and (zx) is an edge in E. Write a Mapreduce algorithm whose input is a directed graph presented as a list of edges (on a file in HDFS), and whose output is the list of all directed cycles of length three in G. 5. Write MapReduce algorithms for problems 4. and 5. For each, describe .(If not already specified) How the input should be represented as a file in HDFS . Pseudocode for the map method, including a specification of what is the key and value for the input, as well as the key and value for an output tuple. . Pseudocode for the reduce method, including a key and value specification similar to that for the map method. If a combiner is useful, then use it and specify the pseudocode for the combiner. .Suppose there were M mappers (map tasks) and R reducers (reduce tasks). Analyze the per-mapper CPU cost, per-reducer CPU cost, and the communication between mappers and reducers. If the computation involves more than one round, then do the analysis for each round. A directed graph G- (V,E) consists of a set of vertices V, and a set of edges E such that each element e in E is an ordered pair (u,v), denoting an edge directed from u to v. In a directed graph, a directed cycle of length three is a triple of vertices (x,y.z) such that each of (xy) (yz) and (zx) is an edge in E. Write a Mapreduce algorithm whose input is a directed graph presented as a list of edges (on a file in HDFS), and whose output is the list of all directed cycles of length three in G. 5