Write a Java program to sort the given string using selection sort. For example, if the given string is JIZAN, the sorted string is AIJNZ

Write a recursive function that parses a binary number as a string into a decimal integer. The function header is as follows:def binaryToDecimal(binaryString):Write a test program that prompts the user to enter a binary string and displays its decimal equivalent.

Write a program that reads a sentence and store it in an array of characters. The program also reads a word and store in it a string variable. The program then conceals the word in the sentence with the character @'. Sample input / output: Enter a sentence: The town in which we live is a green town and big Enter a word: town Result: The @aa@ in which we live is a green @@@@ _and big

Given a string str and number n, write a program that recursively appends a copy of string str n times and returns the resulting string. For example: RecuriveCopy("a", 10) // -> "aaaaaaaaaaa" RecursiveCopy("blah", 5) // -> "blahblahblahblahblahblah" For this exercise, complete the following function. n is the number of copies to add to str: function RecursiveCopy(str, n) { // your code here } Part 2: Call RecursiveCopy Write another function that calls RecursiveCopy() and returns the following string output: "The resulting string [x] has [y] characters". [x] should be replaced by the result from RecursiveCopy) and [y] should be replaced by the number of characters in the resulting string. You may pick the arguments to RecursiveCopy in CountChars or have the user provide input. I will leave this up to you. function CountChars() { } // your code here // call RecursiveCopy(..) // returns a formatted string For example: console.log(CountChars()) // -> "The resulting string blahblahblahblah…