Question 11 : 10 points Reflection: An alternative data structure that implements the list abstract data type is an array. Unlike a linked list, each element in an array doesn't keep a pointer to the next element. Instead, all elements are stored continguously in a single block of memory. To get the location of an element, all we need is the memory address of the first element and the index of the element we want. If we add those two numbers together, we'll get the memory address of the element we want instantly. What are some of the advantages and disadvantages of using an array versus using a linked list? Consider how long it would take to add a new element, delete an element, and find an element given an index in either data structure