Python Write a function def reduced (n): nis a positive int number, greater than 0. The digit 0 does not appear in n. The function returns a positive int number such that includes all digits of n, but only the first most left one for each digit. examples : reduced(4742352273)==47235 reduced(6666666)==6 Requirements : Do NOT use strings. Do NOT use recursion. The function should be efficient