input: Write a python function to find the most efficient order to complete a list of tasks based on their time.
  assert most_efficient_order([Task(5), Task(1), Task(3)]) == [Task(1), Task(3), Task(5)]
  assert most_efficient_order([Task(2), Task(2), Task(2)]) == [Task(2), Task(2), Task(2)]
  assert most_efficient_order([Task(7), Task(10), Task(5)]) == [Task(5), Task(7), Task(10)]
output: def most_efficient_order(tasks):
      return sorted(tasks, key=lambda task: task.time)