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