code: def max_heap_sort(arr, simulation=False):
      """Heap Sort that uses a max heap to sort an array in ascending order
      Complexity: O(n log(n))
      """
      iteration = 0
      if simulation:
          print("iteration", iteration, ":", *arr)
  
      for i in range(len(arr) - 1, 0, -1):
          iteration = max_heapify(arr, i, simulation, iteration)
  
      if simulation:
          iteration = iteration + 1
          print("iteration", iteration, ":", *arr)
      return arr
  
label_desc: Use image node_id 1 for calling a global function with example usage: max_heap_sort(arr, simulation) and returns: arr