Step 3 Now that the array is sorted, create an iterative method called search. This methoddoesn't return anything and takes two parameters, a reference to an int array named numArrayand an int named key. This method prints the left and right indices where the key value can befound in the array. This method should contain the following variables and operations:Four int variables named first, last, leftIndex, rightIndex. Variablesfirst and last hold the index values for the start and end of the array. leftIndexand rightIndex should store the leftmost and rightmost indices that point to the keyvalue.• Two binary searches, one to look for and store the leftIndex where the key firstappears and another that does the same but for the rightIndex.A print statement that prints the two indices where the key value can be found.If the key value doesn't appear in the array, print -1 for the left and right indices.Step 4- Create a test driver to verify your implementation and use the jGRASP plugin tovisualize how the mergeSort and search methods work.Sample Input 1:10 12 6 464 1 206Sample Output 1:Sorted: (1, 4, 4, 6, 6, 6, 10, 12, 20]The duplicates of 6 are between index 3 and index 5Sample Input 2:33, 5, 10, 1, 33, 4, 33, 0, 4, 33Sample Output 2:Sorted: [0, 1, 4, 4, 5, 10, 33, 33, 33, 33]The duplicates of 7 are between index -1 and index -1 Question 1: In this practice, you will implement the Merge Sort algorithm to sort an array ofintegers in ascending order. Additionally, assuming that an array can contain duplicates, for a givenkey, you will write a method that can display the starting and ending position of the key in thesorted array.47.8.numArray10124.6.4.20Step 1- You are given a method called mergeSort, which calls the method mergeSortRec.You are asked to create the method mergeSortRec, which returns nothing and takes thefollowing parameters: an int array reference named numArray, an int first, and an intlast.• The parameters first and last are used to keep track of the indices.The method mergeSortRec should recursively call itself to cut the array into two halves.Invoke the mergeSortRec on the left half and then invoke the mergeSortRec on theright half.It should stop once the array is completely divided. This means that the array can no longerbe divided into two halves (hint: first is no longer less than last).• Then, sort and merge the two halves of the array by invoking the method merge.Step 2-Create the method merge, which sorts and merges the left half and right half of the array.The method returns nothing and takes these parameters: an int array reference namednumArray, an int first, and an int last. This method should contain the followingvariables and operations:A temporary array of length n (hint: if the first index of the array is 4 and the last index is7, then the length of the array is 4).Variables to keep track of the indices.Iterate through the array and compare the element in the left half and the element in theright half, and then add the smaller element to the temporary array.If there are elements leftover from one side of the array, then add the remaining elementsto the temporary array in an iterative fashion.Copy the elements from the tèmporary array to the numArray.

Question

Accepted Answer

Introduction :
Here , we will have to implement the merge sort algorithm to sort an array of…