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. 3. Solution: Method Cost 4. List the order of Big-O terms from lowest to highest. Solution: 5. List the Big-O term for the following sorts and searches: a) Selection sort b) Insertion sort c) Bubble sort d) Quick sort e) Sequential search f) Binary search