Open data structures in C++ please

Exercise 3.2 Design and implement an SLList method, secondLast(), 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.

3.3 Implement the List operations get(i), set(i,x), add(i,x) and remove(i) on an SLList. Each of these operations should run in O(1+ i) time.