Give the prototype of a function search, which receives a sentence sentc and a word wrd and returns 1 or 0.

How many times will the following loop execute?

int x = 2, y = 50;
do
{
    ++x;
    y -= x++;
} while (x <= 10);
return y;

Write the return types of the following library functions:

(a) isLetterOrDigit(char)

(b) replace(char, char)

Define a class to accept a number and check whether the number is Neon or not. A number is said to be Neon if sum of the digits of the square of the number is equal to the number itself.

E.g.
Input: 9

Output:
9 * 9 = 81, 8 + 1 = 9
9 is Neon number.