Why might a developer choose a linked list over an array?

A developer might choose a linked list over an array primarily for ease of managing resizable collections. Linked lists allow for dynamic memory allocation, meaning they can grow and shrink in size as needed without the need for a predefined size or the overhead associated with resizing an array.

In arrays, when there is a need to add or remove elements, especially frequently, it might necessitate the creation of a new larger array and copying over existing elements, which can be inefficient and time-consuming. On the other hand, linked lists can easily insert or delete nodes without this overhead since they just need to adjust pointers, making it a more flexible option for collections whose size may frequently change.

This characteristic allows linked lists to efficiently handle situations where the number of elements is unpredictable or fluctuating over time, making option B the most suitable choice in this context.