6. [10] (adapted from the 2012 ICPC programming competition) 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 (e through 9) at least once? For example, given an input of "1", our sequence would be: and thus k would be 10. Other examples: K value Integer Value 10 123456789 3141592 5