Alice's RSA public key is P = (e,n) = (5, 1501). Bob sends Alice the message by encoding it as follows. First he assigns numbers to characters: A is 4, B is 5, period: 32, a coma: 33, an apostrophe: 34. Then he uses RSA to encode each number separately. .., Z is 29, a blank is 30, quotation marks: 31, a Bob's encoded message is:

Write a Java program to find the number of words in the user entered String. for example: - i/p : o/p : 3 "Awaskar the vdarada"

Write a Java program to perform basic string compression using the counts of repeated characters. For example, the string "aabcccccaaa" would become "a2b1c5a3".

Design a java program with an algorithm that will take a string from the user and then decide if each character in that string is unique. For example, if you ask the user to enter a string and that user enters the world ‘hello’, the result of the algorithm implementedshould return ‘false’ or ‘not unique’. If the user enters a string such as the word ‘phone’ the program will return ‘true’ or ‘unique’ since every character in the word phone is unique and is not repeated. An example of this program follows: Output should show as :  enter a string rizma This string has all the unique characters  would u like to continue?(y for yes n for no) y Enter a string waali This string is not unique