Give an algorithm for finding the second-to-last node in a singly linked list in which the last node is indicated by a null next reference.

Make sure:

Your solution should work on an empty list (return null or throw an exception), as well as a list with only one element (return null or throw an exception). Do NOT use the size method. Give pseudocode.