I thought this would be a very simple
O(n) b.c. you can do the insert any where with in the list.
The longer the list, the longer it will take on average to do the insert.
However according to bigocheatsheet it is
O(1) or has no dependency on the size of the list.
What is wrong here?