Can this be done in Java and not C++ ### Merging Two Sorted Arrays**Concept Overview:**Suppose you have two arrays of integers, `arr1` and `arr2`, each containing integers that are sorted in ascending order.Your task is to write a static method named `merge` that takes these two arrays as parameters. This method should return a reference to a new, sorted array of integers that results from merging the contents of the two arrays, `arr1` and `arr2`.**Implementation Details:**- **Input:** Two sorted arrays of integers, `arr1` and `arr2`.- **Output:** A new array that contains all elements from `arr1` and `arr2`, sorted in ascending order.**Important Note:**You do not need to (and should not) sort the arrays during the merge process. Think of having two sorted piles of cards that you are combining into another pile. You systematically take the smallest card from the top of either pile and place it into the new pile, ensuring the new pile remains sorted.

GIVEN:SOLUTION: public static int[] merge(int[] arr1, int[] arr2){ // create a resultant array of size which is sum of size of arr1 and arr2 int[] merged = new int[arr1.length + arr2.length]; // set i, j and k to start of arrays arr1, arr2 and merged respectively int i=0, j=0, k=0; // loop that continues till we reach the end if arr1 or arr2 for(;i<arr1.length && j < arr2.length; k++) { // if ith element of arr1 <= jth element of arr2 if(arr1[i] <= arr2[i]) { merged[k] = arr1[i]; // insert ith element of arr1 into merged i++; } else // jth element of arr2 < ith element of arr1 { merged[k] = arr2[j]; // insert jth element of arr2 into merged j++; } } // loop to insert the left over elements from arr1 to merged for(;i<arr1.length;i++,k++) { merged[k] = arr1[i]; } // loop to insert the left over elements from arr2 to merged for(;j<arr2.length;j++,k++) { merged[k] = arr2[j]; } return merged;}