2. Reverse a sinlgy linked list, without any use of built in collections or any dependencies.(Implement linked list on your own. do not use java.util package methods) Input : 9 -> 4 -> 2 -> 8 Ouput : 8 -> 2 -> 4 -> 9 3. Find the given two strings are anagrams. isAnagram("apple", "orange"); -> false isAnagram("worth", "throw"); -> true isAnagram("foo", "fun"); -> false 1.[7,1,4,2,0,5,2,9,3] Impl a quick sorting algorithm and explain its space and time complexities in detail
