Given two arrays that are full of integers, recursively merge these two arrays into one large array. The large array should have items from the first array in even indices (0,2,4 ...) and items from the second array in odd indices (1,3,5 ...). Only use recursion to complete this task. You cannot change the method header. public void mergeArrays(int[] arrayOne, int[] arrayTwo, int[] mergedArray){ // Your code here }

Given the below 2 arrays: int​ arr1​[]​ ​=​ ​{​ 9,8,7,6,5,4,3,2,1,0 ​}; int​ arr2​[]​ ​=​ ​{​ ​99, 89, 79, 69, 59​ ​}; Write a program to replace 79 in arr2 with 4 from arr1. Print the final arr2 using Arrays.toString() method. Hint​: Use ​System​.​arraycopy() methodNote​: For all these programs, please submit the program’s .java file and screenshot of output.

Implement getArrayElmsInRange Method Details: getArrayElemsInRange public static int[] getArrayElemsInRange​(int[] array, int lower, int upper) Returns an array with values in the range defined by lower (inclusive) and upper (inclusive). Feel free to use the getCountInRange method during the implementation of this method (See below). Parameters: array - integer array lower - lower limit upper - upper limit Returns: array with values in the range or empty array Throws: java.lang.IllegalArgumentException - if array is null or lower is greater than upper. Any error message is fine (e.g., "Invalid parameters(s)") getCountInRange Method: class Main {             // this function will return the number elements in the given range             public static int getCountInRange(int[] array, int lower, int upper)             {                         int count = 0; // to count the numbers                         // this loop will count the numbers in the range                         for (int i…

Write the method printTail() method that accepts an array of integers and an integer index as parameters and prints all the array elements starting from the index passed. For example if printTail(x,5) is invoked, it should print all the elements of the array x starting at x[5].

I want solution with steps

Create four methods named insertionSort(), bubblesort(), mergesort() and quicksort(). Implement the sorting algorithms in the corresponding methods. In the main method, create four arrays a, b, c, d and initialize them with the same values. Pass these four arrays in four different functions. Create four instance variables named insertionSwap, bubbleSwap, countMerge, and countQuickSort and initialize them to 0. In methods insertionSort(), bubblesort() and quicksort(), increment the variables insertionSwap, bubbleSwap, and countQuickSort respectively by one whenever they call the method swap(). In method mergesort(), increment the variable countMerge by one to count the swaps. Use method swap() to swap the values.

Write a code in java print the largest number in array. Please add comments also and screenshot of output also.