Write a Java program that asks the user to enter two Strings. Then, uses String method compareTo() to compare them, and prints out whether the first string is less than, equal to, or greater than the second string.

What does the following string do to given string str1. String str1 = "Interviewbit".replace(‘e’,’s’); A. Replaces single occurrence of ‘e’ to ‘s’. B. Replaces all occurrences of ‘e’ to ‘s’. C. Replaces single occurrence of ‘s’ to ‘e’. D. None. Tha question is from Java language

Write a Regular expression that check whether a string contains an Vowel or not? You have also include the driver code in Java Language. Your driver code should take string from the user.

Read string integer value pairs from input until "Done" is read. For each string read: • If the following integer read is less than 40, output the string followed by ": low on stock". • Otherwise, output the string followed by ": well stocked". End each output with a newline. Ex: If the input is Oven 43 Curtain 7 Pillow 1 Done, then the output is: Oven: well stocked Curtain: low on stock Pillow: low on stock 1 #include 2 #include 3 using namespace std; 4 5 int main() { 6 7 8 9 10 } * Your code goes here */ return 0;

Write a Regular expression that check whether a string contains an Vowel or not? You have also include the driver code in Java Language. Your driver code should take string from the user.

Use while loop in Java Language Write the method xyzMiddle().** Given a String str, does "xyz" appear in the* "middle" of the string. To define middle, we'll* say that the number characters to the left and* right of the "xyz" must differ by, at most, one.** Examples:* xyzMiddle("AAxyzBB") returns true* xyzMiddle("AxyzBB") returns true* xyzMiddle("AxyzBBB") returns false** @param str the String to examine.* @return true if xyz is in the "middle" of str.*/// TODO - Write the method xyZMiddle here. /*** Write the method named repeatSeparator().** Given two String inputs, word and separator,* along with a third int input count, return a* big String consisting of count copies of word,* each separated by separator.** Note: This is a very common algorithm, called the* fencepost algorithm, because just like building a* fence, you need 11 fenceposts to hold up 10 sections* of fence.** Examples:* repeatSeparator("Word", "X", 3) returns "WordXWordXWord"* repeatSeparator("This", "And", 2) returns...

Write a method that reverses a string. For example, 'java interview' becomes 'weivretni avaj'.

Given a string, write a method that returns the number of occurrences of substrings "baba" or "mama" in the input string recursively. They may overlap. Do not use any loops within your code. Do not use any regular expressions and methods such as matches, split, replaceAll. "Maa mana, Test case 1: countBabaMama ("aba babaa amama ma") 2 Test case 2: countBabaMama ("bababamamama") 4

Write a program that removes all non-alphabetic characters from the given input. Ex: If the input is: -Hello, 1 world$! the output is: Helloworld The program must define and call the following method that takes a string as a parameter and returns the string without any non- alphabetic characters. public static String removeNonAlpha (String userString)

Write a method that finds the number ofoccurrences of a specified character in a string using the following header:public static int count(String str, char a) For example, count("Welcome", 'e') returns 2. Write a test program thatprompts the user to enter a string followed by a character then displays the numberof occurrences of the character in the string.

if strings are immutable, like in Java, we can assume that they have a static length True False