Find the Asymptotic time complexity for each of the functions in
the following:
#Q2
# to denote ayymptotic time complexity use the following
notation
# O(l) O(m) O(a) O(b)
# e.g. traversing through l = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
is O(l)
#1
def merge():
l = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
m = [15, 16, 17, 18]
lm = []
for l_i in l:
lm.append(l_i)
for m_i in m:...