1. what is the Big-O performance of the following function? def sum(n): k = 0 for i in range(n): for j in range(n): k = k + n return k

a. O(1) b. O(n) c.O(n²) d.O(log n)

2. what is the Big-O performance of the following function? def sum2(n): i = n k = 0 while i > 0: k = k + 1 i = i // 2 return k

a. O(1) b. O(n) c.O(n²) d.O(log n)

3. what is the Big-O performance of the following function? def sum(n): k = 0 j = 0 while k < n: k = k + 1 while j < n: j = j + 1 k = k + j return k

a. O(1) b. O(n) c.O(n²) d.O(log n)

4. what is the Big-O performance of the following function? def sum3(n): k = 0 for i in range (n): k = k + i for j in range (n): k = k - j return k

a. O(1) b. O(n) c.O(n²) d.O(log n)

5.what is the Big-O performance of the following function? def sum3(n): k = 0 for i in range (n): k = k + i return k

a. O(1) b. O(n) c.O(n²) d.O(log n)