Solve in java Find the index of a string within a hex encoded string. You will be given a string which needs to be found in another string which has previously been translated into hex. You will need to return the first index of the needle within the hex encoded string. Examples firstIndex("68 65 6c 6c 6f 20 77 6f 72 6c 64", "world") → 6 firstIndex("47 6f 6f 64 62 79 65 20 77 6f 72 6c 64", "world") -8

Make Camel Case.  Create a program that reads a multi-word phrase, and prints the Camel Case equivalent. For example, for input “total account balance” the program shall output “totalAccountBalance”.Notice that the first word is in lowercase (even if it contains uppercase letters). The rest of the words, only their initials are capitalized.

Write a regular expression that defines strings that have an even (but nonzero) number of "a" characters followed by an odd number of "b" characters. For example, aab, aabbb, aaaab, and aaaabbb should all match the regular expression.

For this assignment, you must implement the ElGamal Public-Key Encryption scheme with any programming language that you are comfortable with. The recommendation is to use C/C++ or Java. You can accomplish this assignment individually or by forming a team of 2 students. Alternatively, you can work with your team members of the previous assignment. Your program should get the "key size" from the user in terms of number of bits (for instance, 64, 128, etc). Based on the size, use Fermat or Miller-Rabin primality test algorithm to define your large prime number. You can use the existing programming packages to find a generator of your finite field. Your program should then initialize a pair of key, i.e., private and public keys. For the computations, utilize the Square-and Multiply algorithm. In fact, your program should get a plaintext from the user to perform encryption (generating the ciphertext from the plaintext) and decryption (generating the original plaintext from the ciphertext).…