URGENT!
I must hand this in tomorrow.

We got this exercise a few days ago:
Write a function that receives 3 parameters:
A 4-digit integer, and two digits.
The function checks if the two digits appear next to each other on the left part of the number or on the right part of the number, but not in the middle. The order doesn't matter.
If the digits appear next to each other the function will print the number with the order of the digits reversed, else it will print the number without any changes.
examples:
function(1234, 3, 4) ---> 1243
function(7997, 9, 7) ---> 9779
function(1234, 2, 3) ---> 1234

The function MUST be recursive.
I've thought about it all day and I can't figure out how to do it using recursion.

Help!