Instructions:
1. Write a MapReduce program to find the frequency of each letter,
case insensitive, in some given input. For example, "The quick
brown fox jumps over the lazy dog" as input should generate the
following (letter,count) pairs: (T, 2), (H, 1), (E, 3), etc.
2. Test your program against the 3 attached input
files: HadoopFile0.txt, HadoopFile1.txt, and HadoopFile2.txt.
3. The input and output must be read/written from/into
HDFS.
4. Please submit only the Java source file(s)
on .
5....