. Create a function that takes an array of integers and returns the sum of all prime numbers

#include <iostream>
#include <cmath>
using namespace std;

// Function to check if a number is prime
bool isPrime(int num) {
if (num <= 1) {
return false;
}
for (int i = 2; i <= sqrt(num); i++) {
if (num % i == 0) {
return false;
}
}
return true;
}

// Function to return the sum of all prime numbers in an array
int sumOfPrimes(int arr[], int size) {
int sum = 0;
for (int i = 0; i < size; i++) {
if (isPrime(arr[i])) {
sum += arr[i];
}
}
return sum;
}

int main() {
int arr[] = {3, 4, 7, 10, 11, 13, 17};
int size = sizeof(arr) / sizeof(arr[0]);
cout << "Sum of prime numbers: " << sumOfPrimes(arr, size) << endl;
return 0;
}