Question

#include <iostream>
#include <math.h>
using namespace std;
float f1(int low,int up)
{
int i,total=0.0;
for(i=low;i<=up;i++)
{
total=total+(i*i+i*1.5+4);
}
return total;
}
float f2(int low,int up)
{
int i,total=0.0;
for(i=low;i<=up;i++)
{
total=total+(i*i+i*1.5-4);
}
return total;
}
int main()
{
int low,up;
cout << "This program calculates the area under a curve between two points on the x axis\n";
cout<< "\nThe FIRST equation is: f(x)=x^2 +1.5x +4";
cout<< "\nThe SECOND equation is: f(x)=x^2 +1.5x -4";

cout << "\nEnter x's minimum value : ";
cin >> low;
cout << "Enter x's maximum value : ";
cin >> up;
cout << "\nArea in square inches for FIRST equation\n";
cout << "The area under the curve between "<<low<<" and "<<up<<" is: "<<f1(low,up)<<" square inches.\n";
cout << "\nArea in square inches for SECOND equation\n";
cout << "The area under the curve between "<<low<<" and "<<up<<" is: "<<f2(low,up)<<" square inches.\n";
return 0;
}

PART D) Make all of the user inputs “idiot proof.” PART E) Do a comparison study of the program. Meaning, the program will take more “time” when the number of x axis segments is larger. Also, the accuracy of the number should be greater, with more segments. In other words, you are trading off accuracy for run time. At what point does the number of segments provide improved accuracy vs. the “time” it take the program to execute? F) Have the user input a math equation and you do the calculations. Limit it to a fifth order polynomial equation. the important part is F can you please answer it for me. thanks