Linked List

where $F$ is a pointer to the first element in the list and $L$ is a pointer to the last element in the list. Assuming you only work with the $F,L$ and list element pointers, which of the following operations execute in a time dependent on the length of the list?

Pick ONE OR MORE options

Split the list into two lists of equal length

Add an element before the first element of the list

Interchange the first two elements of the list

Count the elements in the list

Move the element pointed by $L$ to the beginning of the list

Clear Selection