Write a recursive method to print all the permutation of a string. For example, for the string $$abc$,$ the permutation is $[$abc$,$ acb, bac, bca, cab, cba$].(2$ points$)2.$ Revise the genericStack class we did in the class to implement it using an array instead of ArrayList. You need to check the array size before adding a new element. If it is full, create a new array that double the current size and copy the elements from the current to the new array and then add the new array. $(2$ points$)3.$ Use the genericStack class we did the class $($not the one in question $2),$ implement the binary search public static $)$ int binarySearch $($E$[]$ list, E key$)$ and a method that returns the maximum value element public static $)$ E max$($E$[]$ list $(2$ points$)4.$ Write a program that reads words from a text file and displays all the words $($duplicates are allowed$)$ in ascending alphabetical order. The word must start with a letter. The text file is passed as a command$-$line argument. Create your own text file with at least $10$ words in it$.(2$ points$)5.$ Create two priority queues at your own choices, e$.$g$.,\{$George$,$Jim$,$John$,$Blake$,$Kevin$,$Michael$\}$ and $\{$George$,$Katie$,$Kevin$,$Michelle$,$Ryan$,$Ray$,$Jackson$\}$ and write a program that finds their union, difference and intersection. $(2$ points$)$