For this Question: Given two sorted array your task is to merge these two arrays into a single array such that the merged array is also sortedFirst line contain two integers N and M the size of arrays 
Second line contains N separated integers the elements of first array
Third line contains M separated integers elements of second array

<b>Constraints:-</b>
1<=N,M<=10<sup>4</sup>
1<=arr1[], arr2[] <=10<sup>5</sup>Output the merged arraySample Input:-
3 4 
1 4 7
1 3 3 9

Sample Output:-
1 1 3 3 4 7 9
, I have written this Solution Code: n1,m1=input().split()
n=int(n1)
m=int(m1)
l1=list(map(int,input().strip().split()))
l2=list(map(int,input().strip().split()))
i,j=0,0
while i<n and j<m:
    if l1[i]<=l2[j]:
        print(l1[i],end=" ")
        i+=1
    else:
        print(l2[j],end=" ")
        j+=1
for a in range(i,n):
    print(l1[a],end=" ")
for b in range(j,m):
    print(l2[b],end=" "), In this Programming Language: Python, Now tell me if this Code is compilable or not?