$19$

$2$ points

Assume that for some list implementation, a pointer requires $8$ bytes and a data object requires $11$ bytes. Type a fraction $($like $"\frac{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.

type your answer...