2: Merge sort for Circular linked List

3. Take two lists S1 and S2 having unsorted values. The result would be a single list S having

sorted values from both S1 and S2 (duplication Included)

Task 2:

1. Include merge sort with your Array List Class and Single Linked List Class you have implemented in previous lab.

2. Apply Quick Sort on doubly Linked List

done 1st one

Task 1: 1. Include merge sort with your Array List Class and Single Linked List in previous lab. 2. Merge sort for Circular linked List 3. Take two lists S1 and S2 having unsorted values. The result would b sorted values from both S1 and S2 (duplication Included) Task 2: 1. Include merge sort with your Array List Class and Single Linked List in previous lab. 2. Apply Quick Sort on doubly Linked List