I am looking for help using PYTHON3. Implement a method to sort a given array using the merge sort algorithm. Use the algorithm provided

// NOTE: You have to allocate temp array in the main method and copy the original input array A to // the temp array before invoking merge sort in the main method. MERGE-SORT (A, temp, p, r) if p q // left half empty, copy from the right A[k] templil else ifj>r right half empty, copy from the left A[k]- temp[i] Alk] templil A[k] templi] else if temp[j]