A Practical Introduction to Data Structures and Algorithm Analysis

152 Chap. 4 Lists, Stacks, and Queues‘a’ ‘b’ ‘c’ 3 ‘h’ ‘e’ ‘l’ ‘l’ ‘o’ 5top = 100 1 2 3 4 5 6 7 8 9 10Figure 4.32 An array-based stack storing variable-length strings. Each positionstores either one character or the length of the string immediately to the left of itin the stack.4.8 Define an ADT for a bag (see Section 2.1) and create an array-based implementationfor bags. Be sure that your bag ADT does not rely in any wayon knowing or controlling the position of an element. Then, implement thedictionary ADT of Figure 4.27 using your bag implementation.4.9 Implement the dictionary ADT of Figure 4.27 using an unsorted linked list asdefined by class LList in Figure 4.8. Make the implementation as efficientas you can, given the restriction that your implementation must use the unsortedlinked list and its access operations to implement the dictionary. Statethe asymptotic time requirements for each function member of the dictionaryADT under your implementation.4.10 Implement the dictionary ADT of Figure 4.27 based on stacks. Your implementationshould declare and use two stacks.4.11 Implement the dictionary ADT of Figure 4.27 based on queues. Your implementationshould declare and use two queues.