Consider the ArrayList and LinkedList implementations of an indexed List.

Suppose that list$1$ is an ArrayList object and list$2$ is a LinkedList object. Both

list $1$ and list $2$ have $n$ elements.

We want to add an element at index $0,$ given that each list has $n$ elements.

a$)$ What is the time complexity of list$1.$add$(0,$ element$)?$ Explain.

b$)$ What is the time complexity of list$2.$ add $(0,$ element$)?$ Explain.

We want to remove the last element at index $(n-1.$

c$)$ What is the time complexity of list$1.$ remove$($n$-1)?$ Explain.

d$)$ What is the time complexity of list$2.$ remove$($n$-1)?$ Explain.

We want to get the element at index $\frac{n}{2}.$

e$)$ What is the time complexity of list$1.$get$($n$/2)?$ Explain.

f$)$ What is the time complexity of list$2.$get$($n$/2)?$ Explain.