Write a pseudocode function that removes the nodes in even positions (the second, fourth, sixth, and so forth) in a given linked list. No return values are expected. Note: A node in a null-terminated linked list has one pointer, named 'next', that points to the next node if it is not null.