Create MergeSortedArray.javapublic class Solution {     public void merge(int A[], int m, int B[], int n) {         if (A == null || B == null) {             return;         }         int lastIndex = m + n - 1;         while (n > 0 && m > 0) {             if (B[n - 1] < A[m - 1]) {                 A[lastIndex] = A[m - 1];                 m--;                 lastIndex--;             }             else {                 A[lastIndex] = B[n - 1];                 n--;                 lastIndex--;             }         }         while (n > 0) {             A[lastIndex] = B[n - 1];             lastIndex--;             n--;         }     } }