Notes:

*In C++ object oriented (a must!)

*Please provide output* and code* for each problem 15.24-15.26 (found a bunch on chegg and they dont work, ergo asking here), thank you in advance I do appreciate your work and effort!

15.24 (Sieve of Eratosthenes with bitset) This exercises revisits the Sieve of Eratosthenes for find- ing prime numbers that we discussed in Exercise 7.27. Use a bitset to implement the algorithm Your program should display all the prime numbers from 2 to 1023, then allow the user to enter a number to determine whether that number is prime. 15.25 (Sieve of Eratosthenes) Modify Exercise 15.24, the Sieve of Eratosthenes, so that, if the number the user inputs into the program is not prime, the program displays the prime factors of the number. Remember that a prime number's factors are only 1 and the prime number itself. Every nonprime number has a unique prime factorization. For example, the factors of 54 are 2, 3, 3 and 3. When these values are multiplied together, the result is 54. For the number 54, the prime factors output should be 2 and 3. 15.26 (Prime Factors) Modify Exercise 15.25 so that, if the number the user inputs into the pro- gram is not prime, the program displays the prime factors of the number and the number of times each prime factor appears in the unique prime factorization. For example, the output for the num- ber 54 should be The unique prime factorization of 54 is: 2* 3 * 3 * 3