Add a method:

to the LispList interface of Exercise •• P16.9 . Implement the method in the EmptyList and NonEmptyList classes. When merging two lists, alternate between the elements, then add the remainder of the longer list. For example, merging the lists with elements 1 2 3 4 and 5 6 yields 1 5 2 6 3 4.

Data from exercise  P16.9 The LISP language, created in 1960, implements linked lists in a very elegant way.
You will explore a Java analog in this set of exercises. Conceptually, the tail of a list—
that is, the list with its head node removed—is also a list. The tail of that list is again a list, and so on, until you reach the empty list. Here is a Java interface for such a list:

LispList merge (LispList other)