1. Why is it not possible to use a dummy node in an SLList to avoid all the special cases that occur in the operations push(x), pop(), add(x), and remove()?
2. Design and implement an SLList method, second Last (), that returns the second-last element of an SLList. Do this without using the member variable, n, that keeps track of the size of the list.