Given an integer n (in base 10) and a base k, return the sum of the digits of n after converting n from base 10 to base k.

After converting, each digit should be interpreted as a base 10 number, and the sum should be returned in base 10.

&nbsp;
Example 1:

Input: n = 34, k = 6
Output: 9
Explanation: 34 (base 10) expressed in base 6 is 54. 5 + 4 = 9.


Example 2:

Input: n = 10, k = 10
Output: 1
Explanation: n is already in base 10. 1 + 0 = 1.


&nbsp;
Constraints:


	1 &lt;= n &lt;= 100
	2 &lt;= k &lt;= 10


class Solution:
    def sumBase(self, n: int, k: int) -> int:
        cnt = 0
        while n:
            cnt += (n % k)
            n //= k
        print(cnt)
        return cnt
class Solution {
    public int sumBase(int n, int k) {
        int res = 0;
        for (; n > 0; n /= k)
            res += n % k;
        return res;
    }
}
class Solution {
public:
    int sumBase(int n, int k) {
        int sum=0;
        while(n!=0) sum+=n%k,n=n/k;
        return sum;
    }
};
/**
 * @param {number} n
 * @param {number} k
 * @return {number}
 */
var sumBase = function(n, k) {
    return n.toString(k).split("").reduce((acc, cur) => +acc + +cur)
};
Sum of Digits in Base K