Arrays Vs Linked Lists: select all true statementsMemory is aligned for an Array - each elements are back to back in the memoryWe can easily remove an element from an ArrayLinked list can contain as value a structureWe can easily removed an element from a Linked listMemory is aligned for a Linked list - each elements are back to back in the memoryWe can add elements indefinitely to an arrayArray can contain as value a structureWe can add elements indefinitely to a linked list

The true statements are:

1. Memory is aligned for an Array - each elements are back to back in the memory.
2. Linked list can contain as value a structure.
3. We can easily remove an element from a Linked list.
4. Array can contain as value a structure.
5. We can add elements indefinitely to a linked list.

Explanation:

1. In an array, elements are stored in contiguous memory locations.
2. Both linked lists and arrays can contain any data type or structure as their elements, including structures.
3. Removing an element from a linked list is easier than from an array because you just need to change the link of its previous node to its next node. In an array, all elements after the removed element need to be shifted.
4. As mentioned above, arrays can contain any data type or structure as their elements.
5. Linked lists can grow and shrink during the execution of a program, allowing us to add elements indefinitely, as long as the system's memory allows. On the other hand, the size of an array is fixed at the time of its declaration.