Please dont copy paste and define your answer briefly. Thank you

1-

Find out the complexity of the code written below with full explanation.

def complex_algo(items):

for i in range(5):

print ("AAA is awesome")

for item in items:

print(item)

for item in items:

print(item)

print("Big O")

print("Big O")

print("Big O")

complex_algo([4, 5, 6, 8])

Calculate total space complexity of algorithm in terms of N. Describe the Linear space complexity and prove the following code follows that property.

function sumofall (arr[],N)

{

sum=0

for (i=0 to N)

sum= sum + arr[i]

}

print (sum)

}