Add a main so that you can put some code there to call your functions and make sure they work:

public static void main(String[] args) { /* your testing code goes here */ }

Functions you should add if the functionality is possible. Otherwise add an empty function definition with a comment saying "impossible".

9. public static boolean isPermutatieoahtiString string1, String string2) s ous aume e sr (Ihis finctinns should return true if string1 is a permutation of string2. In this case you should assume that means contains exactly the same characters, same case, including spaces. The strings may contain ascu oru Gode,characters. For this question, you should optimize for space and fairy short input strings. " Test input: Same as #8 10. public static beolean checkUniaueigbtin) values) r This function should return true if all the values in the array are unique i.e. there are no duplicates. Optimize this solution for space and for small-isb arrays Test input: empty array: f2, 4, 6, 1, 3, S [2, 4, 6, 2, 4, 6) 11. public static beolean checkUniaueFast(int] values) r This function should return true if all the values in the array are unique i.e. there are no duplicates. Optimize this solution for time and for large-ish arrays Test input: Same as #10