**What is wrong in this? Please help!**

def mergesort(arr):if(len(arr) <= 1):return arrmid = len(arr) // 2left = mergesort(arr[:mid])right = mergesort(arr[mid:])merge(left,right,arr)def merge(a,b,c):i,j,k = 0,0,0print(a,b)while(i < len(a) and j < len(b)):if(a[i] < b[j]):c[k] = a[i]i+=1k+=1else:c[k] = b[j]j+=1k+=1while( i < len(a)):c[k] =a[i]