input: Write a python function to find the first prime number in a list.
  assert findPrime([4, 6, 8, 9, 10, 11, 12]) == 11
  assert findPrime([15, 18, 20, 23, 24, 25]) == 23
  assert findPrime([0, 1, 2, 3, 4, 5, 6]) == 2
output: def findPrime(lst):
      def is_prime(n):
          if n <= 1:
              return False
          for i in range(2, int(n**0.5) + 1):
              if n % i == 0:
                  return False
          return True
      
      for num in lst:
          if is_prime(num):
              return num
      return None