input: Write a function to find the largest three numbers in a list. The function should return a list containing these three largest numbers. If the list has fewer than three numbers, the function should return the largest numbers available.
  
  def find_largest_three(my_list):
      if len(my_list) < 3:
          return sorted(my_list, reverse=True)
      return sorted(my_list)[-3:]
  
  assert find_largest_three([1, 6, 3, 8, 7, 4])==[6, 7, 8]
  assert find_largest_three([4, 3, 1, 2])==[2, 3, 4]
  assert find_largest_three([10, 20])==[10, 20]
  assert find_largest_three([5])==[5]
  assert find_largest_three([])==[]
output: def find_largest_three(my_list):
      if len(my_list) < 3:
          return sorted(my_list, reverse=True)
      return sorted(my_list, reverse=True)[:3]