Analysis of algorithms. Consider the following code fragment. (8 Points) int func ( int n ) { int i = 0, sum = 0; while ( sum < n ) sum += ++i; return i; } (a) Suppose that it takes 1 second when N = 3, 500. Approximately how long will it take when N = 350, 000? And why?

(b) How to analyze different algorithms to select a better one? That is, what factors we care most?