In java and please create the following program please add comments to the code as well.

Creative Problem 2.2.16 Natural Merge Sort

Example: For the array 1, 3, 5, 2, 4, 0, 10, 15, 11, 13

Bottom up will start by taking arrays of one and merge: 1, 3. 2, 5, 0, 4, 10, 15, 11, 13

The natural merge sort will start with the longest sorted subarrays:

• First merge: 1, 3, 5 with 2, 4 and get 1, 2, 3, 4, 5
• Second merge 0, 10, 15 with 11, 13 and get 0, 10, 11, 13, 15
• After first pass we obtain: 1, 2, 3, 4, 5, 0, 10, 11, 13, 15
• At the second pass we merge 1, 2, 3, 4, 5, with 0, 10, 11, 13, 15
• And we obtain the result 0, 1, 2, 3, 4, 5, 10, 11, 13, 15
• This is the final result as it is ordered.