please answer the following correctly with showing the code andur work and output.
- Analysis of Time Efficiency
- Analyze lines 43 to 67 (ignoring comments and “cout”statements) of main.cpp and express the algorithm’s timeefficiency in Big-O notation
lines 43 to 67 (ignoring comments and “cout” statements)do { if (sum !=T) { if (sum > T) // toss it and get a new sum! {
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured