Hadoop MapReduce program in Java to find centroids and its members with k-means clustering.

Write a hadoop MapReduce program in Java to find centroids and its members with k-means clustering. Program must have the following parameters: a. input​: input.txt. The file has the following format: id1<\tab>number1,number2,...,number10 id2<\tab>number1,number2,...,number10 ... b. output​: Output centroids and their members cluster1<\tab>id1, id2,... cluster2<\tab>id1, id2,... ... c. k​: Number of centroids. Set k=4​. d. maxIter​: Stop criterion. For simplicity, stop after a certain number of iterations. Set maxIter=10​. Important Points: 1) Kindly try to have separate Mapper Reducer Classes. 2) Kindly use hadoop mapper reducer 3) Kindly write the output in [login to view URL] 4) Kindly read the input as it is provided in input.txt. Please do not chage [login to view URL] 5) Program needs to follow all the hadoop mapper, reducer, input, output, fileread, filewrite for ex: ([login to view URL]~gabriel/courses/cosc6339_s15/[login to view URL]) import [login to view URL]; import [login to view URL]; import [login to view URL]; import [login to view URL]; import [login to view URL]; import [login to view URL]; import [login to view URL]; import [login to view URL]; import [login to view URL]; import [login to view URL]; import [login to view URL]; import [login to view URL]; import [login to view URL]; import [login to view URL]; import [login to view URL];