Write a function that will calculate the sum of all the numbers multiple of 3 from N down to 1 using recursion. HINT: SAMPLE ALGORITHM int computeTotal(int n) { /1. declare a variable sum and initialize it to 0 to add all nos that are multiple l/of 3 1/2. test if n is equal to 0 I/ if true return n 1/3. else { //tests if n is divisible by 3 //if true test if(sum==0) sum=n; return sum+= computeTotal(n-1);

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.