a. Give a Big-Oh analysis of the running time. b. Implement the code and run for several values of N. c. Compare your analysis with the actual running times.

you should first derive a (closed-form, no-summation notation) formula for the exact number of times that the sum++ statement executes. Be sure to explain what you are doing, not just write equations. Use your derived formula to state a big-Theta estimate; you can use the usual shortcut of dropping lower-order terms and constant factors only at this last stage.

for( int i 1; i