input: Write a function to find and return the top 3 largest numbers from a given array of integers. If the array has fewer than 3 elements, return all the available elements in descending order.
  def top_three(numbers):
      sorted_numbers = sorted(numbers, reverse=True)
      return sorted_numbers[:3]
  
  print(top_three([7, 13, 5, 8, 50, 11, 64, 48]))
  assert top_three([7, 13, 5, 8, 50, 11, 64, 48])==[64, 50, 48]
  assert top_three([3, 5, 2])==[5, 3, 2]
  assert top_three([1, 2])==[2, 1]
output: def top_three(numbers):
      sorted_numbers = sorted(numbers, reverse=True)
      return sorted_numbers[:3]