PYTHON DATA ALGORITHMS MULTIPLE CHOICE QUESTION

Consider the following code fragment that counts the number of pairs j and k for which the sum of a[j] + b[k] is zero.

for j in range(m):

for k in range(n):

if a[j] + b[k} == 0:

count += 1

What is the order of growth of the running time of this code fragment?