Give a python implementation for the midstack adt. the midstack adt supports the following operations * midstack (): initializes an empty midstack object . mids. is_empty (): returns true if s does not contain any elements, or false otherwise len (mids): returns the number of elements mids mids. push (e) : adds element e to the top of mids. mids. top (): returns a reference to the top element ofmids, without removing it; an exception is raised if s is empty mids. pop ): removes and returns the top element from mids; an exception is raised ifmids is empty . * e mids. mid push (e) : adds element e in the middle of mids that is, assuming there are n elements in s: in the case n is even, e would go exactly in the middle. if n is odd, e will go after the "2th element. for example, your implementation should follow the behavior as demonstrated in the two execution examples below: > > > míds = midstack() > > > mids. push (2) > > > mids. push (4) > > > mids. push (6) > > > mids. push (8) > > > mids. mid push (10) > > > mids. pop () > > > midsmidstack ) > > > mids. push (2) > > > mids. push (4) > > > mids. push (6) > > > mids. push (8) > > > mids. push (10) > > > mids. mid push (12) > > > mids. pop () 10 > > > mids. pop () > > > mids. pop () 6 > > > mids. pop () 10 > > > mids. pop () > > > mids. pop ) 12 > > > mids. pop () > > > mids. pop () 2 > > > mids. pop( > > > mids. pop () 2

Which if the following allows you to view and access important information about your documents all in one location

Some of the first computer games were created in the early 1970s by college students experimenting after hours to see what the were capable of doing.

We as humans write math expression in infix notation, e.g. 5 + 2 (the operators are written in-between the operands). in a computer’s language, however, it is preferred to have the operators on the right side of the operands, i.e. 5 2 +. for more complex expressions that include parenthesis and multiple operators, a compiler has to convert the expression into postfix first and then evaluate the resulting postfix.write a program that takes an “infix” expression as input, uses stacks to convert it into postfix expression, and finally evaluates it. it must support the following operations: + - / * ^ % (example infix expression: (7 - 3) / (2 + 2)postfix expression: 7 3 - 2 2 + /result: 1guidelines: 1. you will need to use stacks in three placesa. one for the parenthesis check [char stack]b. one during infix to postfix [char stack]c. one during evaluation [int stack]for a and b above, you can use same array and same push, pop method as both ofthem are char. but for evaluation you have int stack and you might consider to createanother push pop method to handle it. maybe push_int, pop_int, etc. or find otherstrategy to utilize existing push pop method2. you can create a function for obtaining operator priority. that function should take anoperator as input and return its priority as an integer. this function will you a lot andreduce repeated code3. during evaluation you will need to convert char into integer. example for single digit: char c = '5'; int x = c - '0';