Can you do this java question and show me the code

7. Given a positive integer n, return the number of p-additions needed to make it a palin- drome (reads the same left-to-right as right-to-lef). A p-addition is the addition of the to its inverse. For example, if n-159, the first p-addition yields 159-951-1110, number and the second p-addition yields 1110+111-1221, which is a palindrome. Hence, the return for 159 is 2. If n is a palindrome to begin with then return zero, and if the number does not become a palindrome after 10 p-additions then return -1. public static int palindroCount Cint n) Implement this method and test it in the main method of a class