Q: Given two sorted arrays: Sample Input: A = [1, 5, 9, 11, 13] B = [3,6,7,10,12, , , , , ,] (contains space to accommodate array A elements) Sample Output: B = [1,3,5,6,7,9,10,11,12,13] Write a function that accepts two arrays (A&B) and returns a single merged sorted array B without using Arrays. sort or Collection. sort. Assume that Array B will always have additional space to accommodate Array A elements.