MapReduce Programming Exercise

Create a MapReduce job that will read a file full of words and discover if any of the words are anagrams of each other. (such as opus and soup) If you can write the actual program to do this, do so - either in Java or in some other language using Hadoop Streaming. If you do not have the programming background, you can simply write pseudocode describing the function of the Map and Reduce functions of such a job. The input file for this job should be a file containing text, such as the following: I drove my car over the bridge. I had to stop at a spot beside a post where dogs rove across the road. The output for the job should look something like this: over rove post spot