What is the 'main' disadvantage of a linked list compared to an array?Group of answer choicesRequires more memory to store pointersCannot be easily sortedRequires more complex algorithms for insertion and deletionDoes not allow random access of elements

The main disadvantage of a linked list compared to an array is that it does not allow random access of elements.

Here's why:

1. In an array, elements are stored in contiguous memory locations. This allows us to directly access any element in the array using its index. For example, if we want to access the 5th element in the array, we can do so directly using its index (array[4] in a zero-based index array).

2. In contrast, a linked list is a data structure in which elements are not stored at contiguous memory locations. Instead, elements are linked using pointers. Each element (or node) in a linked list contains two items: the data and a "link" to the next node in sequence.

3. Because of this structure, if we want to access a particular element in the linked list, we have to start from the first node and follow the links to the desired element. We cannot directly access an element in the linked list like we can in an array.

4. This lack of random access in linked lists can lead to increased time complexity for certain operations. For example, accessing an element in an array is a constant time operation, O(1), while accessing an element in a linked list is a linear time operation, O(n), where n is the number of elements in the list.

So, while linked lists have their own advantages and use-cases, the lack of random access is a significant disadvantage compared to arrays.