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) = 10111 (ten thousand, one hundred and eleven)

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

Which of the follow statement is FALSE about decToBin ?

Question options:

	All of the other statements are FALSE
	If the base case is true the function should return 1
	decToBin is tail recursive
	decToBin cannot be rewritten in iterative form