A program has two parameters, M and N$.$ At the high level, the code looks like this:

for counter in range$($M$)$:

perform expensive computation$1$

for counter in range$($N$)$:

perform expensive computation$2$

Big$-$O analysis of this code yields the following time complexity:

Question $11$