Please only answer question 2

1. Modulo: Write a recursive function called modulo(int n, int m) which computes and return n%m without using the arithmetic operator (%). Example: 2. Sum of digits: Write a recursive function that takes as parameter an integer N and returns the sum of its digits. In this function you will need to call the function modulo0 defined in Exercise above Example: N-524 The sum of digits is: 11