Working with ChainSort.java apply incrementalInsertionSort algorithm to work with a linked chain instead of an array and implement a Shell sort for a...

Working with ChainSort.java apply incrementalInsertionSort algorithm to work with a linked chain instead of an array and implement a Shell sort for a linked chain. The skeleton of the application is provided.

Before calling incrementalInsertionSort method, set the previous pointers to create the appropriate sub-chains as shown in the picture below:

During the sorting process, replace appropriate data without changing the next pointers.

Sample run with 7 elements and seed 11:

Implement //TODO methods.