input: Write a python function to check if elements in a list are prime numbers.
  assert check_lst([7, 8, 12, 19, 22, 23]) == [True, False, False, True, False, True]
  assert check_lst([2, 3, 5, 10, 17, 20]) == [True, True, True, False, True, False]
  assert check_lst([11, 13, 15, 16, 18, 29]) == [True, True, False, False, False, True]
output: def check_lst(lst):
      def is_prime(n):
          if n <= 1:
              return False
          if n <= 3:
              return True
          if n % 2 == 0 or n % 3 == 0:
              return False
          i = 5
          while i * i <= n:
              if n % i == 0 or n % (i + 2) == 0:
                  return False
              i += 6
          return True
      
      return [is_prime(num) for num in lst]