1. Examine the techniques for adding and removing a node at the head. Why are these techniques implemented as static methods rather than ordinary IntNode methods? 2. Write some code that could appear...

1. Examine the techniques for adding and removing a node at the head. Why are these techniques implemented as static methods rather than ordinary IntNode methods?

2. Write some code that could appear in a main program. The code should declare head and tail references for a linked list of integers and then create a list of nodes with the data being integers 1 through 100 (in that order). After each of the nodes is added, head and tail should still be valid references to the head and tail nodes of the current list.