The binary representation of a given decimal integer number can be printed from right to left ( from least significant bit to the most significant bit) using the following method:

if (number = = 0) print 0; otherwise print number%2 and repeat the same process for n/2.

i.Write a recursive method that prints the binary representation from left to right for a given decimal integer

ii. Compute the time complexity of this method.