1. Repeat Exercise 5, but instead consider the first entry of the portion first. 2. Repeat Exercises 5 and 6, but write a string backward instead of an array. 3. A palindrome is a string that reads...

1. Repeat Exercise 5, but instead consider the first entry of the portion first.

2. Repeat Exercises 5 and 6, but write a string backward instead of an array.

3. A palindrome is a string that reads the same forward and backward. For example, deed and level are palindromes. Write an algorithm in pseudocode that tests whether a string is a palindrome. Implement your algorithm as a static method in Java. Exercise 11 and Project 3 in Chapter 5 asked you to describe how to do this using a stack.

4. Write a recursive method that counts the number of nodes in a chain of linked nodes.