I'm working on a java multi-part question and need an explanation and answer to help me learn.

Challenge #5a – Recursion

Given a string, compute recursively (no loops) a new string where all the lowercase 'x' chars have been changed to 'y' chars.

changeXY("codex") → "codey"
changeXY("xxhixx") → "yyhiyy"
changeXY("xhixhix") → "yhiyhiy"

____________________________________________________

Per the syllabus Requirements:

Assignments:

Each week, students will be assigned a CHALLENGE program, which will be started during the lab time, and must be completed and turned in via Canvas by midnight on Sunday. All programming assignments are required to be turned in as "zipped" Netbeans projects, so that the graders can have a consistent means of "unzipping" and testing the programs.

Ensure your student id, section, and due date appear in the comments of your programming assignments, to give you proper credit. Do not put your name in the comments, since we use anonymous grading.

Naming Conventions for Files:

In Netbeans, name your project file as follows:

Challenge#_PID (example: Challenge#1_12345678)

Check that the zipped assignment you turned in to Canvas is the correct assignment. Download the zipped file from Canvas and double-click it until you get to the source folder. Then double click the .java files within the source folder and visually inspect the .java file using Notepad or Wordpad, to ensure it is the correct assignment.

If you mistakenly upload the wrong program, and it is BEFORE the deadline, and it has NOT been graded yet, you can re-upload the correct version. If the program has already been graded, you are not allowed to re-upload it for a better grade. Your original grade will stand, even if it is a 0 for submitting the wrong assignment, and your re-submission will not be graded.