Write a function, persistence, that takes in a positive parameter num and returns its multiplicative persistence, which is the number of times you must multiply the digits in num until you reach a single digit.

Persistent_Bugger.py

######### Refactored #########

def persistence(n):
    if n < 10: return 0

    multiplier = 1

    while(n > 0):
        multiplier = (n % 10) * multiplier
        n = n // 10
    return persistence(multiplier) + 1