Write the definition of a **recursive** subprogram `sc` that receives through parameter `n` a natural number (with at most 9 digits) and returns the sum of its digits, computed **recursively** (without using any repetitive statements: `for`, `while`, `do...while`). Also write a subprogram `radacina` that receives through parameter `n` a natural number and returns the digital root of `n`: if `n` has a single digit, return `n`; otherwise return the digital root of the digit sum of `n`. The subprogram `radacina` must use the subprogram `sc`. Then write a main program that reads from standard input a non-zero natural number `t`, then `t` natural numbers `x`, separated by spaces or newlines. For each of the `t` numbers, the program prints on a separate line two values separated by a space: `sc(x)` and `radacina(x)`.