I want an algorithm that fulfills the conditions for this project in Java and applies to Nitbeans

1 Sorting Algorithms For your first practical, you will implement two sorting algorithms, Insertion Sort and Merge Sort. Implemented algorithms sort an array of strings into ascending lexicographic order. Insertion sort Insertion sort is a simple sorting algorithm; a comparison sort in which the sorted array is built" one entry at a time. In every step of insertion sort, an element is taken from the unsorted segment of the array and is "inserted" into the correct position in the already-sorted segment of the array. This is done until no elements remain in the unsorted segment. Algorithm 1 INSERTION-SORT INSERTION-SORT(A) 1: for each j = 2 to size(A) do 2: key = A[i] 3: while i>O and A[i] >key do 5: A[i+1] = A[i] i = i-1 7: A[i+1] = key 6: Given the description and algorithm above, you are asked to implement in- sertion sort algorithm as the first coding part of this practical. 1 Merge sort Merge sort is another simple sorting algorithm, it follows Divide-and-Conquer strategy where the problem is divided into sut-problems until it reaches size of 1 or 0. Merge sort works recursively to perform splitting task. In every step of Merge sort, an element is taken from the resorted sub-segment of the array and continue dividing until it reaches a single sorted element. Then moving backward and comparing each element with other elements. Algorithm 2 MERGE-SORT MERGE-SORT(A, P, T) 1: if p