Development of distributed application using JAVA RMI

Using JAVA RMI develop a set of programs (server, client, interfaces, security policies, batch scripts) to solve the following problem: Implement mergesort algorithm using a server and a client (where m can be 1, or 100,200,300,...,1000). The program should generate randomly an array of n integer numbers not ordered (where n is the input parameter that could vary between 1 million and 10 million with increments of 1 million). Afterwards, the array should be distributed between the m clients equitably. In case that the array's size is not divisible by the number of clients, for simplicity, use the immediate inferior integer number (for example if the array contains 1 million integers and we have 300 clients, then each client should sort 3,333 numbers for a total of 999,900 distributed numbers). Afterwards, each client should organize its part and resends it sorted to the server so this one can generate the final array sorted from the sorted subarrays. The code should include instructions to measure time in communication and processing that the program uses in each case. Also instructions to record the time, the results, maybe a sheet or text file, so it can be used to generate a graph or another option could be that the program generates automatically the graphs required. Shell scripts should be created for all the possible different inputs required (variation between m and n), including a file with the examples of the executions, its results and graphs. GRAPHS: 1. processing time vs. number of clients vs. size of data 2. communication time vs. number of clients vs. size of data 3. processing time + time of communication vs number of clients vs size of data