creating a recursive funtion to return integers of the result of an xor operation
Please I saw this question & I got into a trance of anxiety trying to answer it, although I am not that fluent in java talk more of knowing C programming, so I need help, the question is as follows;
Bitwise exclusive or (xor) operation can be applied to two binary numbers where between two corresponding bits, 1 xor 1 = 0, 1 xor 0 = 1, 0 xor 1 = 1 and 0 xor 0 = 0. For instance, 1101011 xor 1010101 = 0111110. Define a recursive function that takes two integer parameters simulating the two input binary numbers and returns the result of the xor operation as an integer. Call and test the function in the main program (NB: the preceding zeros of the result may not appear on the display, and this is ok). 
Thank you
creating a recursive funtion to return integers of the result of an xor operation
===

Please I saw this question & I got into a trance of anxiety trying to answer it, although I am not that fluent in java talk more of knowing C programming, so I need help, the question is as follows;
Bitwise exclusive or (xor) operation can be applied to two binary numbers where between two corresponding bits, 1 xor 1 = 0, 1 xor 0 = 1, 0 xor 1 = 1 and 0 xor 0 = 0. For instance, 1101011 xor 1010101 = 0111110. Define a recursive function that takes two integer parameters simulating the two input binary numbers and returns the result of the xor operation as an integer. Call and test the function in the main program (NB: the preceding zeros of the result may not appear on the display, and this is ok). 
Thank you