Complete the seperateDuplicateChars () method in Seperate Duplicates.java follows:

Write the following programs in Java: In the Converter class write the static method, bin2decimal(String bin). The parameter for this method is an unsigned (nonnegative) binary number represented by a string. The method returns the decimal equivalent for the binary parameter, as an integer.If the binary string is invalid (contains characters other than ‘0’ and ‘1’), the method returns -1. Convert from a binary (b) string with up to 16 digits to decimal (d) using the following formula:? = ?0 + ?1 × 2 + ?2 × 22 +⋯+ ?7 × 215where b0, b1, ?2, … ?7 are the binary digits in order of increasing significance. For example, 1101 is: 1 + 0×2 + 1×22 + 1×23 = 13 in decimal. Side note: You may NOT use the decode method of the Long wrapper class instead of this formula.   In the Converter class write another static method, english2encrypted(String english). The parameter for this method is a word or sentence represented by a string. The word or sentence should only contain letters (no digits,…

Write program in java

Make a Java class for storing data of employee. Make a class Employee has data members eid(int), experience(int), sal (int) and name (String). Make a second class EmployeeArray that declares an array of Employee. You have to add following public methods void addEmployee(Employee val); ( This functions add employee to the array. While adding employee make sure size of array increases when it gets full. Employee is added in sorted order with respect to experience. You are not allowed to sort array. Find appropriate index for the value and place value at that index. While adding data also ensure that any data does not get duplicated. bool Remove (int eid); ( This function will receives eid as argument and delete an employee from array whose eid matches with argument. When a value gets deleted shift rest of data. If value is removed successfully returns true otherwise return false) Employee valueAt(int index) (This function receives index as argument and returns value of that index if…

Use java and correctly indent code.

Write a static recursive method in Java called mRecursion that displays all of the permutations of the charactersin a string passed to the method as its argument. For example, the character sequence abc has thefollowing permutations: acb, bac, bca, cab, cba. Then Write a static method called getInput that get aninput string from the user and passed it to the mRecursion method written above in a method call.Please does so using what I already had   //Get input from in to call recursive method        //to display those char permutations        public static String getInput ( ) {            Scanner in = new Scanner(System.in);            String combination = in.nextLine();            System.out.println("Enter string:);             return stringComb; //Method to show permutations of a desired string// This only return 3 string combination for some reason        static void myRecursion(String aString) {            //isEmpty check            if ( aString.length() == 0){…

For JAVA.

In writing a general-purpose sort method in Java, the sort method needs to compareobjects. There are two ways to give the sort method the code to compare objects,implementing the interfaces Comparable and Comparator respectively. Extend Article class toimplement Comparable interface so that the default sorting of the Articles is by its volume

Write a java class named RecursiveMergeSort that implements the recursive algorithm for Merge Sort.You can use the structure below for your implementation.