Which of the following operations do have a constant big$-$O running time on python lists $($i$.$e$.$ which operations are not expected to depend on the number of items in L$)?$ Mark all that apply $($one or more$).$

Reading the value at a certain index:

L$[5]$

Changing the value at a certain index:

L$[5]=$ 'hello'

Removing the first item in the list:

L$.$pop$(0)$

Creating a slice of the last $3$ items:

L$[-3$:$]$

Adding an item to the end of the list:

L$.$append$(\text{'}$hello$\text{'})$