1. Given the following code fragment, what is its Big-O running time and why? ***********A*********

test = 0

for i in range(n):

for j in range(n):

test = test + i * j

***********B*********

test = 0

for i in range(n):

test = test + 1

***********C*********

for j in range(n):

test = test - 1

i = n while i > 0:

k = 2 + 2

i = i // 2