Write a Java program to enter any sentence and convert the sentence to uppercase. Print only those words of the sentence whose first and last letters are the same.

Define a class to accept the gmail id and check for its validity.

A gmail id is valid only if it has:

→ @

→ .(dot)

→ gmail

→ com

Example: icse2024@gmail.com is a valid gmail id

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);
    }
}

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;
}