Write a helper method reverse which takes in a string and returns the string backwards. For example, if given "Hello", it will return "olleH" o Hints (you don't have to use these, but they may be helpful): You can convert a string to an array of characters using (Java) string.toCharArray() or (C#) string. ToCharArray(); Once you have an array of characters, you can reverse them pretty easily. You can convert an array of characters back to a string with (Java) String x-new String(charArray) or (C#) string x = new string(charArray); You may use a loop or recursion for this method. Write a helper method which converts all ^ to v and all v to ^ in a string. It should take in and return a string. o Hint: You may find (Java) string.replace() or (C#) String.Replace() useful. Write a static method, paperFold, which is a recursive routine that returns a string representing the fold pattern for a paper folded n times. The driver program will call the paperFold method As in many recursive solutions, expect the paperFold method to be extremely simple (and of course recursive).