Write a method that accepts any prime integer as an input parameter. Return the sum of the digits of that prime number. You must solve this problem using recursion in a non-trivial way and without using any string commands. You may assume the input parameter is prime and do not need to do any verification of this fact.