Given n and k, return how many of the numbers 1, 2, …, n are multiples of k. This is a small example of why performancePerformanceHow much time (and memory) a program needs, especially as its input gets larger. matters. A check-every-number loop is fine for n = 20 but does a million checks for n = 10⁶ — and real programs run such code thousands of times. A little thinking turns the whole loop into a single division. Both are correct; only one scalesScalabilityHow well a solution keeps up as the input grows much larger..