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