What is the time complexity of the following program: int a[N + 1][M + 1][K + 1];sum = 0; for ( i = 1 to N){for (j = i to M){for (k = j to K){sum += a[i][j];}}}

part a

in a city ice cream is mostly only bought when the temperature is very high as ice cream cools down our

so we can derive the conclusion that as the temperature increases the number of ice creams sold also increases

part b

y intercept is 5

slope is 2

happy to

pls mark as brainliest

10 you would take 50/ .2

step-by-step explanation:

lockers 1, 4, 9, 16, 25, 40, and 49 are open

i ran through it by the other answer is wrong