1. Write a code for reversing a singly linked list L using only a constant amount of additional space and not using any recursion. What is the time complexity of your code? Write a recursive code that finds the number of values greater than x in a linked list of integers. Write a short recursive Java method that takes a character string s and outputs its reverse. So for example, the reverse of "pots&pans" would be "snap&stop 2. 3. 4. Let B be an array of size n 2 6 containing integers from 1 to n - 5, inclusive, with exactly five 5. 6. repeated. Describe a good algorithm for finding the five integers in B that are repeated Write a short recursive Java method that determines if a string s is a palindrome, that is, it is equal to its reverse. For example, "racecar" and "gohangasalamiimalasagnahog" are palindromes Write a code using recursion to add all the elements in a nxn (two dimensional) array of integers