Write a Java program that sorts a list of n items by dividing it into three sublists of about n/3 items, sorting each sublist recursively and merging the three sorted sublists. The Java program and the corresponding function(s) should be flexible enough to deal with different cases and example data should be provided in the main function of this Java program to check its correctness. You must use the divide and conquer strategy to solve this problem