Recall that in a LinkedList, add takes (1) worst-case time, but accessing the item at position i takes time (i). Consider the following code: L = new list for i=1 to n do L.add (1). for i=1 to n do print (L[1]) What is the total runtime of this code if L is implemented (a) using a LinkedList and (b) using a Doubling Array List (the amortized data structure discussed in class). Show and explain you work. You may use the results about amortized runtime of the Doubling Array List from class. Hint: You do not have to solve any sort of recurrence to answer this question. If you use the definition of amortized complexity, (b) is a one-line calculation.