Establish the smallest quantity of 9's that evenly divides a specific odd number.
Write a function, `find_smallest_mul_of_nine(n)`, which accepts a positive odd number `n` and returns the least occurrence of `9`s that can be evenly divided by `n`. ### Parameters - `n` (integer): A positive odd number. ### Return Value - Returns (integer): The minimal number of `9`s that results in a multiple of `n` when divided by `n`. ### Examples ```python # 999999 divided by 13 equals 76923 with no remainder find_smallest_mul_of_nine(13) # returns 6 # 9 divided by 3 equals 3 with no remainder find_smallest_mul_of_nine(3) # returns 1 # 999999 divided by 7 equals 142857 with no remainder find_smallest_mul_of_nine(7) # returns 6 ```