Analize the following statements about the complexity of operations in a data structure: O(n), O(n) and O(1).

The search operation has a complexity of O(n) because in the worst case scenario you will have to traverse the entire list sequentially until you find the last element.

The insertion operation, in its worst case scenario, will place an element at the beginning of the list, forcing all others to be shifted one position, taking O(n) operations.

The removal operation also has, in its worst case scenario, to remove the first element, which will force all others to be shifted one position, taking O(n) time.