Note: The code needs to be in Java and the starter code needs to be used as well. Part 1:Your classmate Yurtle has a sticky keyboard and sometimes he presses down on a letter key for too long and so 'a' willbe typed as 'aa' or 'aaaaa'. (For some reason the space bar and period keys work fine and all those characters he wantsto keep.)Create a java íle with a class called 5tringHelper. In it write the method as described below.public static 5tring clean5tring(String input)Write a static recursive method that creates a "clean string" getting rid of any of the adjacent duplicate letters. Yourmethod may not contain any for loops. (Adjacent means "next to each other")Examples:input: "wattteer in thhhhhhhheee Illakke" → output: "water in the lake"input: "egrreattt dayyy!!" → output: "great day!"input: "so.. whhhaaaat diiidd you sayy?" → output: "so. what did you say?"Hint: You will need to use the 5tring substring method.Part 2:Create a java file with a class name Recursive5ort. In it write an implementation of the recursive merge sort algorithmdiscussed in class.public static int] merge5ort(int] list)Hint: You may want to make a separate helper mergelint] a, into b) method that will merge two sorted arrays into onelarger sorted array. A helper merge can contain a for loop.Hint: You may also find the Arrays copyOfRange function useful. It creates a copy of an array between two indexes.int] copiedArray = Arrays.copyOfRange(array, 0, 4); Starter code:// RecursionHomework.java// Your name here//import java.util.Arrays;class stringHelper {Your classmete Yurtle has a sticky keyboard and sometimes he pressesdown on a letter key for too long and so 'a' will be typedas 'aa' or 'aaaaa'. (For some reason the space bar and periodkeys work fine and all those characters he wants to keep.)Create a java file with a class called stringHelper.In it write the method as described below.public static string cleanstring(string input)krite a static recursive method that creates a "clean string"getting rid of any of the adjacent duplicate letters.Your method may not contain any for loops.Examples:input : "watttteer in thhhhhhhheee 111lakke" + out put : "water in the lake"input: "egrreatttt dayyy!!" + out put : "great day!"input: "so. whihhaaaat diiidd you sayy?" - out put : "so. what did you say?"*/public static string cleanstring(string input){}}class Recursivesort {Create a java file with a class name Recursivesort.In it write an implementat ion of the recursive merge sortalgorithm discussed in class.public static int [] mergesort(int [] list)Hint: You may want to make a separate helpermerge(int [] a, int [] b) method that will merge twosorted arrays into one larger sorted array.*/public static int [] mergesort(int [] list){}Testing:Make sure you test your work. Include tests for base cases and recursive cases. (You have to make sure all branches ofyour conditional logic work!)

Question

Note: The code needs to be in Java and the starter code needs to be used as well. Part 1:Your classmate Yurtle has a sticky keyboard and sometimes he presses down on a letter key for too long and so 'a' willbe typed as 'aa' or 'aaaaa'. (For some reason the space bar and period keys work fine and all those characters he wantsto keep.)Create a java íle with a class called 5tringHelper. In it write the method as described below.public static 5tring clean5tring(String input)Write a static recursive method that creates a &#34;clean string&#34; getting rid of any of the adjacent duplicate letters. Yourmethod may not contain any for loops. (Adjacent means &#34;next to each other&#34;)Examples:input: &#34;wattteer in thhhhhhhheee Illakke&#34; → output: &#34;water in the lake&#34;input: &#34;egrreattt dayyy!!&#34; → output: &#34;great day!&#34;input: &#34;so.. whhhaaaat diiidd you sayy?&#34; → output: &#34;so. what did you say?&#34;Hint: You will need to use the 5tring substring method.Part 2:Create a java file with a class name Recursive5ort. In it write an implementation of the recursive merge sort algorithmdiscussed in class.public static int] merge5ort(int] list)Hint: You may want to make a separate helper mergelint] a, into b) method that will merge two sorted arrays into onelarger sorted array. A helper merge can contain a for loop.Hint: You may also find the Arrays copyOfRange function useful. It creates a copy of an array between two indexes.int] copiedArray = Arrays.copyOfRange(array, 0, 4); Starter code:// RecursionHomework.java// Your name here//import java.util.Arrays;class stringHelper {Your classmete Yurtle has a sticky keyboard and sometimes he pressesdown on a letter key for too long and so 'a' will be typedas 'aa' or 'aaaaa'. (For some reason the space bar and periodkeys work fine and all those characters he wants to keep.)Create a java file with a class called stringHelper.In it write the method as described below.public static string cleanstring(string input)krite a static recursive method that creates a &#34;clean string&#34;getting rid of any of the adjacent duplicate letters.Your method may not contain any for loops.Examples:input : &#34;watttteer in thhhhhhhheee 111lakke&#34; + out put : &#34;water in the lake&#34;input: &#34;egrreatttt dayyy!!&#34; + out put : &#34;great day!&#34;input: &#34;so. whihhaaaat diiidd you sayy?&#34; - out put : &#34;so. what did you say?&#34;*/public static string cleanstring(string input){}}class Recursivesort {Create a java file with a class name Recursivesort.In it write an implementat ion of the recursive merge sortalgorithm discussed in class.public static int [] mergesort(int [] list)Hint: You may want to make a separate helpermerge(int [] a, int [] b) method that will merge twosorted arrays into one larger sorted array.*/public static int [] mergesort(int [] list){}Testing:Make sure you test your work. Include tests for base cases and recursive cases. (You have to make sure all branches ofyour conditional logic work!)

Accepted Answer

According to guidelines, we are only allowed to answer question at a time, please repost the…