Write MapReduce algorithms for the following tasks. 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. Given a file with n integers, find their maximum, minimum, and average.