代写java MapReduce 案例A sample input file is given below. Each line corresponds to a point-of-interest (POI), which contains a keyword, coordinate values x and y (separated by white space).https://essay-expert.com/cs-java/We measure the distance between two points p1=(x1,y1) and p2=(x2,y2) by:dist(p1, p2) = Ö(x1 – x2)2 + (y1 – y2)2Each keyword k is associated with a group G(k) of points. [Example] The group of “park” contains two points: (3,5) and (2,4).There are 2 questions in this programming assignment.You should write a MapReduce program to solve each of them.Question Q1: Find the centroid (i.e., the mean position of points) of each group.[Example]Input: the sample input above Output:lake  5.5 5.5mall  1.5  5.5park  2.5 4.5Question Q2: Find the diameter (i.e., the maximum distance between any two points inside a group) of each group.[Example]Input: the sample input above Output:lake 8.602mall  3.162park 1.4142. Requirements代写java MapReduce 案例Though MapReduce support multiple languages, in this assignment, you should use Java (Java 8) forYou submission should be organized asfollows YourStudentID // your folder name, [Example] 19001234g  Q1.java // source file for question 1  Q1.jar // jar file for question 1, compiled and archived from Q1.java  Q2.java // source file for question 2  Q2.jar // jar file for question 2, compiled and archived from Q2.javaArchive the above structure as YourStudentID .zip and submit this .zip filein blackboard. [Example] 19001234g.zipMake sure that you can compile your source file and run with the latestHadoop version’s (i.e., Hadoop 3.2.1) pseudo-distributedYour jar file should be directly runnable on Linux platform with the following call: bin/hadoop jar Q1.jar Q1 input path outputpath bin/hadoop jar Q2.jar Q2 input path output path Your output result should preserve doubleYou should only use one MapReduce round to solve eachsub-question.[Hint] You may use the Ubuntu image we provided for this