Write a function vector *genPrimes(int M) that returns a pointer to a vector of prime numbers from 2 to M. There are several algorithms to do this, but the Sieve of Eranthoses is the most common one.

code:

primes.cpp

#include #include "Primes.h"

std::vector *genPrimes(int M) { std::vector *v = new std::vector(); // your code here

return v; }

primes.h

#ifndef _PRIMES_H #define _PRIMES_H

#include

std::vector * genPrimes(int M);

#endif