Answer to Question 14A-2

int numPrime(const int A[], const int n)
{
  int count = 0;
  for(int k = 0; k < n; k++)
  {
    if(isPrime(A[k]))
    {
      count++;
    }
  }
  return count;
}