Match each data structure to its correct description. Write the letter of the description in the Matching Description column. Each data structure will have a description, BUT NOT all descriptions will be matched to a data structure. (1.2 points) Matching Description Data Structure Deque Doubly linked list Ordered List Queue Stack Unordered List Descriptions A. A data structure which implements a FIFO strategy. B. A data structure which implements a LIFO strategy. C. A data structure which maintains all data values in descending sort order. D. A data structure which maintains all data values in ascending sort order. E. A data structure which uses next and previous pointers to reference nodes in a linked list. F. A data structure which uses next pointers to reference nodes in a linked list. G. A data structure which allows items to be added to the front or rear of the list. H. A data structure which allows items to be added to or removed from the front or rear of the list. A