You are given two sorted arrays, A and B, and A has a large enough buffer at the end to hold B. Write a method to merge B into A in sorted order without using any other array space.Implementation instruction:1) Define one array of size 18 for A and the other array of size 5 for B.2) Initialize A by inputting 13 integers in the ascending order, and Initialize B by inputting 5 integers in the ascending order.