Traceback (most recent call last): File "main.py", line 41, in <module> mergeSort(arr, 0, N - 1) File "main.py", line 33, in mergeSort mergeSort(arr, l, m) File "main.py", line 33, in mergeSort mergeSort(arr, l, m) File "main.py", line 35, in mergeSort merge(arr, l, m, r) File "main.py", line 12, in merge if L[i] <= R[j]:NameError: name 'R' is not defined

Traceback (most recent call last): File "./main.py", line 44, in <module> print(mergeSort(arr, n)) File "./main.py", line 3, in mergeSort return _mergeSort(arr, temp_arr, 0, n-1)NameError: name '_mergeSort' is not defined

Input65 1 3 15 10 4OutputTraceback (most recent call last): File "main.py", line 41, in <module> mergeSort(arr, 0, N - 1) File "main.py", line 33, in mergeSort mergeSort(arr, l, m) File "main.py", line 33, in mergeSort mergeSort(arr, l, m) File "main.py", line 35, in mergeSort merge(arr, l, m, r)NameError: name 'merge' is not defined

Explain the significance of merge sort

What is the base case in the Merge Sort algorithm when it is solved recursively?

What is the precise purpose of merge() method in Merge Sort? a. It inserts maximum element from the subarray to the end b. It rearranges all elements according to the pivot point c. It sorts an array using Divide and Conquer concept d. It joins two unsorted subarrays into one e. It joins two sorted subarrays into one