please solve this question using Java

Write a recursive method removeXs, that removes all instances of the character 'x' from the given string. The only string methods you may use for this problem are shown on the cover of the exam; you may also use the '+' operator. A solution that doesn't use recursion or has a loop will receive little to no credit. Notes: solutions which include calls to substring can receive full credit, and (as usual) you are allowed to define a helper method to do the actual recursion. Examples: str removeXs (str) I1 T1 "ab" "axb" "xabcxyzxx" "ab" "ab" "abcyz" 1n // returns a String like str, but with all the 'x' characters removed // (uses recursion) public static String removexs (String str)