$)$ Describe the characteristics $($operation scheme$)$ ofStack, Queue, and Positional List ADT

Describe which concrete data structure can be used to respectively implement the above three

respectively.

$(1\%)$ What is the maximum number ofparentheses that appear on the stack when the algorithmabstract data structure conveniently.$(3\%)$ What values are returned during the following seguence ofdeque ADT operations, on ananalyzes:$(0(0)(0)).$initially empty deque? addFirst$(3),$ addLast$(8),$ addLast$(9),$ addFirst$(1),$ last$(),$ isEmpty$()$addFirst$(2),$ removeLast$(),$ addLast$(7),$ first$(),$ last$(),$addLast$(4),$ size$(),$ removeFirst$(),$removeFirst$().$