Match the following items about different types of array implementations. Not all selections may be used and some may be used more than once. 0(1) a. b. 0(n/4) The average cost to insert into or delete from an array implementation of a list is ... O(n/2) C. The maximum cost to insert into or delete from an array implementation of a list is ... d. O(n) The average cost to insert into or delete from a linked implementation of a list is ... O(nlg n) e. The maximum cost to insert into or delete from a linked implementation of a list is ... The list allows random access. f. The maximum cost to insert into a garbage collection style implementation of a list is ... The maximum cost to delete from a garbage collection style implementation of a list is ... h. An advantage to an array implementation of a list is ... i. A disadvantage to an array implementation of a list is ... The list requires sequential access. g. Extra logic (beyond shifting) is required to find a place to insert Insertions and deletions require shifting to obtain or remove space. Generally the insertions and deletions are more efficient. There is effectively no size limit to the list during program execution. There is a risk of false overflows. j. An advantage to a linked implementation of a list is ... A disadvantage to a linked implementation of a list is ... k. 1. An advantage to a garbage collection style implementation of a list is ... There is a risk of false underflow. m. A disadvantage to a garbage collection style implementation of a list is ... If necessary, insertions and deletions warp around to the begining of the array. n. Queues, stacks and general lists can be supported at the same time. 0