#assignment operation [ ]=left[ii= + = + while <len(right)#assignment operation [ ]=right[jj= + = + print('merging 'areturn(awe run this program for the following resultsthe problem that we are interested in is how we determine the running time performancethat iswhat is the rate of growth in the time it takes for the algorithm to complete relative to the size of to understand this bit betterwe can map each recursive call onto tree structure each node in the tree is recursive call working on progressively smaller sub problems