Consider the following algorithm to add two one-dimensional arrays together.
def array1d_sum(myArray1, myArray2):
n1 = length(myArray1)
n2 = length(myArray2)
if(n1 not equal n2):
print("Warning: Arrays not same length!")
sumArrays = []
for i in [0, 1, ..., n1 - 1]:
sumArrays[i] = myArray1[i] + myArray2[i]
return sumArrays
What is the run-time complexity of the alrorithm, using big-O notation?