input: Write a function to find the sublist of prime numbers in the given list of integers. Return the sublist consisting of the prime numbers. If the list is empty, return an empty list.
  def is_prime(num):
   for i in range(2, num // 2 + 1):
   if num % i == 0:
   return False
   return True
  
  def prime_list(lst):
   prime_lst = []
   for num in lst:
   if is_prime(num):
   prime_lst.append(num)
   return prime_lst
  
  assert prime_list([2, 8, 3, 6, 10, 7, 14, 11, 17, 15])==[2, 3, 7, 11, 17]
  assert prime_list([4, 6, 8, 9, 10])==[]
  assert prime_list([])==[]
  assert prime_list([2, 3, 5, 7])==[2, 3, 5, 7]
  assert prime_list([11, 13, 15, 17, 19])==[11, 13, 17, 19]
output: def prime_list(lst):
   prime_lst = []
   for num in lst:
   if num > 1:
   for i in range(2, int(num**0.5) + 1):
   if num % i == 0:
   break
   else:
   prime_lst.append(num)
   return prime_lst