1. Write a program to do selection sort on a linked list.

a. Create a single linked list of at least 10 nodes. The values in the nodes are not in sorted order of any kind

b. Now sort the linked list in descending order. Do not swap the values of nodes to sort, but instead unlink the actual nodes and re-link them so that the final list is sorted.

c. Do linked list traversal from head : first before sort , then a second time after sort. d. submit the code. Also submit screen shot of execution results.

2. We have done binary search in class. Write a RECURSIVE program to do tertiary search.

a. Create an array of at least 15 values in sorted order - descending. .

b do tertiary search to find an item. I,e in stead of dividing the list into 2 halves, divide it into 3 parts.

c. run the program to find an existing item in the list d. Second time run the program to try and find a non existing item in the list. e. submit code and screen shot of execution.

write it in Java