Write a function that takes an integer input and check whether it can be expressed as the sum of two prime numbers. If it can be expressed as sum of two prime numbers then print those numbers. You also need to account for multiple combinations of prime number. Take a range as input from use and print all such number in that range. You can use as many helper function as needed. Sample: Enter range: 2 10 Range 2 to 10: 4: Can be written as 2 +2 5: Can be written as 3+2 6: Can be written as 3 + 3 7: Can be written as 2 + 5 8: Can be written as 3 + 5 9: Can be written as 2+7 10: Can be written as 3 + 7 10: Can be written as 5 +5

Write a function averageDigits that computes the average of the digits of a 3-digit positive number in the range [100,999), Use the following function prototype: double averageDigits(int); For example, averageDigits(936) returns 6.0 ((9+3+6)/3). Write a test program that prompts the user to enter a 3-digit number, call the function averageDigits and print the result in the main program. The process is repeated if the user enters y to continue.

Write a function that returns the greatest common divisor of 2 integers.

Write a function that takes the current date and corrects the number of days, if it's wrong. The function must return true if the date passed to it is a valid date and false, if not. The main function uses the returned value to either print "Date validated", if a valid date was entered or "Invalid date entered. Changed to ", followed by the modified date.

Write a function that finds and returns the smallest value of n for which: 1 + 2 + 3 + ... + n is greater than or equal to max (where max is a number input from the user).   You can use the following prototype:  int SmallestValue(int);  In the main program be sure to declare all variables and show the call. Be user friendly! Sample run:     What is the max number:          23 The smallest value of n where the sum of 1 to n is greater or equal to 23 is:  7 Again? Y What is the max number:        12 The smallest value of n where the sum of 1 to n is greater or equal to 12 is: 5 Again? N in c++ please use basic coding I'm not too advanced

Write a function named product that takes two int parameters and returns the product of those two integers. Here is an example: int n = product(7, 5); // n is 35 We are providing a test framework that, if you wish, you may use with a compiler to test your function. What you will submit as your answer to this problem is only the product function. Do not submit things like the #include lines or a main routine. If we take the code you write in the space below and insert it into the program, the resulting program must build without compilation errors (mere warnings are allowed). You do not need to write comments in the code; we will not look at any comments. Here is the test framework that you may copy and paste into a C++ source file. For your own testing purposes, you might add additional tests in the main routine, although you won't be turning them in, of course. #include <iostream> #include <cassert> using namespace std; // SUBMIT AS YOUR ANSWER ONLY THE CODE BETWEEN THIS…