Assume that for some list implementation, a pointer requires 4 bytes and a data object requires 14 bytes. Type a fraction (like "1/2") to show how full the array should be for the break even point, that is, the point beyond which the array-based list implementation needs less space than the linked list implementation. Give your fraction in lowest terms.

7/9 of the array will be full.

Explanation:

Array full at time=size of data object/(size of data object+size of pointer)

                           =14/(14+4)=7/9

7/9

Explanation:

As the array fills up, its overhead reductions.  

The pointer space is overhead.  

The greater the overhead portion, the less the cluster should be better. The greater the information field, the more the exhibit should be better.  

The make back the initial investment point is at 1/9.  

In the event that you have values like 4/8, diminish to 1/2.