(40 points)

1. (30 pts) Exercise 2 Chapter 5. (Note that there are special cases to take care of. For example, inset into an empty list or remove from a link with one node. The first step to solve this problem should be to identify all possible cases.)
2. (5 pts) Exercise 10 Chapter 5.
3. (5 PTS) Write a method to count the number of positive integers in a linked list of integers iteratively.