Write pseudocode for a remove() method for a singly linked list that always removes at the Head end.

Assume Head and Tail references are available.

remove() should return the element of the node that is removed. (You don't have to deal with garbage collection.)

Handle the case where there are no items in the list (throw an exception)