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 T/F