Consider a recursive function decToBin $($decimal$)$ that converts a decimal number to a binary representation but still in base $10.$ Note that all inputs and output are $32-$bit integers.

Example outputs:

decToBin$(7)=111(one$ hundred and eleven$)$

decToBin$(23)=1011(ten$ thousand, one hundred and eleven$)$

decToBin$(18)=10010(ten$ thousand and ten$)$

What is the recursive relation of the function decToBin?

None of the other answers are correct

$T(n)=K+T(n-1)$

$T(n)=K+T(\frac{n}{2})$

$T(n)=K+T(\frac{n}{10})$

$T(n)=K+T(n-2)$