3. Write code for a method that uses a loop to compute the sum of all the integers from 1 to N. Perform an algorithm analysis, counting each basic operation (such as assignment and increment++) as one operation. Express your algorithm analysis in Big-O notation. Solution: + int main(){ Int sum=0; Forlint-1; j