A student defines a function that returns double the final element of a list. They have two ideas for calling the function:

def double last$($L$)$:

return' $2**L-1$

double$\_$last$($my$\_$list$)$ #technique $1$

double$\_$last$($my$\_$list$[]])$ # technique $2$

If $n$ is the number of items in my$\_$list, what is the running time of technique $1?$

$O(1)$

$O(log(n))$

$O(n)$

$O(n^2)$

$O(n^3)$