This one feels like it should've been easy but unfortunately I'm struggling with it. I looked at the code Chegg has for my book Starting out with early objects c++ 9th edition. It has limes, oranges, and lemons on the cover.

It is supposed to be a prime number generator using function objects (I believe these are also called functors) or using lambda expressions.

I have attached what the books question is since it has more detail. The program needs to be in 3 file format, the main, header, and implementation file.

If anyone can help I'd highly appreciate it.

11. Prime Number Generation A positive integer greater than 1 is said to be prime if it has no divisors other than 1 and itself. A positive integer greater than 1 is a composite if it is not prime. Write a program that asks the user to enter an integer greater than 1 and prints the list of all prime numbers less than or equal to the number entered. Your program should use a predicate (function object or a lambda) that determines whether a given integer is composite. The program should generate the list of prime numbers less or equal to X by adding all positive integers greater than 1 to a vector and then using the remove_if function and the predicate to remove all composites from the vector. 84