chap listsstacksand queues top ' ' ' ' ' ' ' ' figure an array-based stack storing variable-length strings each position stores either one character or the length of the string immediately to the left of it in the stack define an adt for bag (see section and create an array-based implementation for bags be sure that your bag adt does not rely in any way on knowing or controlling the position of an element thenimplement the dictionary adt of figure using your bag implementation implement the dictionary adt of figure using an unsorted linked list as defined by class llist in figure make the implementation as efficient as you cangiven the restriction that your implementation must use the unsorted linked list and its access operations to implement the dictionary state the asymptotic time requirements for each function member of the dictionary adt under your implementation implement the dictionary adt of figure based on stacks your implementation should declare and use two stacks implement the dictionary adt of figure based on queues your implementation should declare and use two queues