In an array-based linear list, if you delete an element from the middle, what happens to the remaining elements? Group of answer choicesThey are all shifted one position to the leftThey remain in their original positionsThe elements to the right of the deleted element are shifted leftThe array is resized to remove the empty space

In an array-based implementation of a linear list, what is the time complexity of deleting an element from the end of the list? Group of answer choices

What happens to the size of an array when an element is deleted?

When deleting an element from the middle of a 1D array, what is the primary challenge?

When inserting an element at the second position of an array, what happens to the original second element?

What is the advantage of using arrays to implement a linear list?Group of answer choicesConstant time insertion at any positionDynamic resizingMinimal memory usageEfficient random access to elements