java program Write a recursive method called that accepts an

integer as a parameter and returns the integer obtained by replacing every digit of with two of that digit. For example,

should return $.$ The call

should return $0.$ Calling on a

negative number should return the negation of calling on the corresponding positive number; for

example, should return $.$