In Python, the data structure "list" supports the following operations:

$-$ AddToFront $\backslash (($x$)\backslash )$ adds $\backslash ($ x $\backslash )$ to the beginning of the sequence.

$-\backslash (\backslash$operatorname$\{$AddToEnd$\}($x$)\backslash )$ adds $\backslash ($ x $\backslash )$ to the end of the sequence.

$-$ Lookup $\backslash (($k$)\backslash )$ returns the $\backslash ($ k $\backslash )-$th item in the sequence, or Null if the current length of the sequence is less than $\backslash ($ k $\backslash ).$

Outline a basic data structure designed for "list". Ensure that your methods for AddToFront and AddToEnd operations achieve an amortized time complexity of $\backslash ($ O$(1)\backslash ),$ while Lookup operation should take $\backslash ($ O$(1)\backslash )$ in the worst case. The data structure should use $\backslash ($ O$($n$)\backslash )$ space, where $\backslash ($ n $\backslash )$ represents the current number of elements. You do not need to write the pseudocode. Focus on amortized analysis.