input: Write a function to generate the most efficient order of tasks based on the given array of tasks. Return the ordered list of tasks in the most efficient completion sequence. If the given array is empty then return an empty list.
  assert most_efficient_order([])==[]
  assert most_efficient_order([Task(4), Task(2), Task(1), Task(3)]) == [Task(1), Task(2), Task(3), Task(4)]
  assert most_efficient_order([Task(3), Task(5), Task(2), Task(1), Task(4)]) == [Task(1), Task(2), Task(3), Task(4), Task(5)]
output: def most_efficient_order(tasks):
      return sorted(tasks, key=lambda task: task.duration)