data structures

(asentence to describe (20 points): 1. Select one type of ADT and explain how each of the following functions would operate for som an array and a linked list implementation. For the linked list, demonstrate that you know on the linkages would be established or broken. 18 points) (a) Addition of an entry (b) Removal of an entry (c) Determination if the ADT is empty (d) Number of entries in the ADT I have an array, called MYDATA, which supports 3 ADT functions (see below). The parameter "indx" is an integer variable which identifies the array location (always at the right) where th newest value will be added. "e" is a variable which contains the value 7. "Y" is a variable Assume the array supports 10 instances, already populated with do diagram to show how the array is