Consider a linked list implemented using ONLY this code:

Which of the following statements are true:

Question $12$ options:

Finding the length of this list can be an O$($n$)$ operation

There is no way to remove data from this list

Deleting items from this list is an O$(1)$ operation

Finding the previous item on this list is an O$(1)$ operation