Recursion

Complete the definition for sum_prime_digits, which returns the sum of all the prime digits of n. Recall that 0 and 1 are not prime numbers. Assume you have the function is_prime defined (Ex: is_prime(5) will return True). You may use the guidelines below or you may suggest your own solution.

def sum_prime_digits(n): """ >>> sum_prime_digits(12345) 10 >>> sum_prime_digits(4681029) 2 """ if ____________________________________________: return ____________________________________ else: ___________________________________________ if ________________________________________: return ________________________________ return ____________________________________

use python