text: # TO-DO: complete the helper function below to merge 2 sorted arrays
  def merge(arrA, arrB):
      elements = len(arrA) + len(arrB)
      merged_arr = [0] * elements
      # TO-DO
  
      return merged_arr
  
  
  # TO-DO: implement the Merge Sort function below USING RECURSION
  def merge_sort(arr):
      # TO-DO
  
      return arr
  
  
  # STRETCH: implement an in-place merge sort algorithm
  def merge_in_place(arr, start, mid, end):
      # TO-DO
  
      return arr
  
  
  def merge_sort_in_place(arr, l, r):
      # TO-DO
  
      return arr
  
  
  # STRETCH: implement the timsort function below
  def timsort(arr):
      # TO-DO
  
      return arr
  