Python -

Write an algorithm to solve the following problem and specify its runtime complexity using the most relevant terms:

Given a nonnegative integer, what is the smallest value, k, such that:

n,2n,3n,...,kn

contains all 10 decimal numbers (0 through 9) at least once?

For example, given an input of "1", our sequence would be:

1,2(1),3(1),4(1),5(1),6(1),7(1),8(1),9(1),10(1)

and thus k would be 10. Other examples:

Integer Value	K value
10	9
123456789	3
3141592	5