Write a complete C++ program that finds and stores all primes numbers strictly less than 1000 in a vector and compiles a report in which it displays the number of primes found in the following ranges 0 to 250, 250 to 500, 500 to 750, and 750 to 1000. Make sure that you test your program and validate the results of your program. Your program must use the function _is_prime(k) given below and C++ vector class. #include #include using namespace std; // function is_prime(k) returns true if k is prime and false otherwise. bool is_prime(int k); int main() { return 0; } // function implementation // is_prime(k) returns true if k is prime and false otherwise. bool is_prime(int k) { if (k < 2) return false; for (int i = 2; i <= static_cast (sqrt(k)); i++) if (k % i == 0) return false; return true; } What I have tried: tried to play around with the skeleton, but it's complicated for me because im a beginner