Hello, please provide solution and explanation, thank you. This is a Data Structures course with C++ Programming.

1. Give the asymptotic complexity for the worst case run-time of the following function foo() with respect to its input N. You may assume function bar() runs in constant time with respect to N. For full credit you should show how you arrived at your answer. An answer that solely provides a value in Big O notation without reason will receive zero points. Answers that include variables other than N will receive fewer points. 1 void foo(unsigned int n) { unsigned int S = 0; 2 3 5 for (unsigned int i = 1; i