1. A linked implementation of a list a. uses memory only ass need for new entries b. returns unneeded memory to the system when an entry is removed C. avoids moving data when adding or removing entries d. all of the above 3. In a chain of linked nodes you can a. remove nodes from the beginning of a chain b. remove nodes from the end of a chain C. remove nodes that are between other nodes d. all of the above