For a linked list implementation of a stack, what do you think the easiest and most efficient implementation of the push (to the front of the linked list or to the end) and pop (from the front of the linked list or from the end) operations? Please justify your answer.