Consider the following program segment in which the statements are jumbled, choose the correct order of statements to check if a given word is Palindrome or not.

boolean palin(String w) {
    boolean isPalin;
    w = w.toUpperCase();
    int l = w.length();
    isPalin = false; // Stmt (1)
    for (int i = 0; i < l / 2; i++) {
        char c1 = w.charAt(i),
                c2 = w.charAt(l - 1 - i); // Stmt (2)
        if (c1 != c2) {
            break; // Stmt (3)
            isPalin = true; // Stmt (4)
        }
    }
    return isPalin;
}

Write a program in Java to enter any sentence. Also ask the user to enter a word. Print the number of times the word entered is present in the sentence. If the word is not present in the sentence, then print an appropriate message.

A shopping website offers a special discount if the order ID has the sequence 555 anywhere in it. For example, 158545553031, 198555267140, …. .

Fill in the blanks (a) and (b) in the given Java Method to convert the order ID (a long integer) into a string and check if the sequence 555 is present in it.

void checkOrder(long oid)
{
    String str = _______(a)_________;
    if(______(b)_______)
    {
        System.out.println("Special Discount Eligible: " + oid);
    }
}

Define a class to accept a string and convert the same to uppercase, create and display the new string by replacing each vowel by immediate next character and every consonant by the previous character. The other characters remain the same.

Example:
Input : #IMAGINATION@2024
Output : #JLBFJMBSJPM@2024