1) Write a Three-Way-Merge(A, B, C) algorithm that merges three sorted sequences into a single sorted sequence, and use it to implement a Three-Way-Merge-Sort(L) algorithm. Also, analyze the complexity of Three-Way-Merge-Sort, and compare it with Merge Sort. Complete this in Java

2) Sort a nearly sorted (or K sorted) array Given an array of n elements, where each element is at most k away from its target position, devise an algorithm that sorts in O(nk) time. For example, let us consider k is 2, an element at index 7 in the sorted array, can be at indexes 5, 6, 7, 8, 9 in the given array. Complete this in Java