(40 pts) For each of the following four program fragments:

(a) Give an analysis of the running time (Big-O will do).

(b) Implement the code in C + +, and give the running time for n = 10, n = 100, n = 1000, and n = 10000. If it takes more than 5 minutes, just report > 5. In case all of them take 0 second, try to use greater numbers. 1

(c) Compare your analysis with the actual running times.

sum 0 : for( 1-0; i n; ++i +Hsum sum = 0 ; for ( i=0; i n;tti ++sum int sum= 0; for ( i= 1; i void f using namespace std; sum 0 : for( 1-0; i n; ++i +Hsum sum = 0 ; for ( i=0; i n;tti ++sum int sum= 0; for ( i= 1; i void f using namespace std