Write a Java project that implements selection, bubble, insertion and merge sort algorithms that sort lists of random doubles in the range [0, 1000). Use array objects or objects created from API classes that implement java.util.List to contain the lists. Using the sorting algorithm implementations, compare execution time performance of these sorts for random double lists of the following lengths:

- 100,000

- 200,000

- 400,000

- 800,000

Output should be in the form of a table of number of elements sorted and type of sort. Hint: Use System.out.printf

** Can you please leave comments before each class method on what you are doing in the program.