Explain this Infix to Postfix code briefly into explanation and Flowchart presentation (Python 3)

class Stack: def init_ _(self) self.items = [] self.length 0 def push (self, val) self.items.append (val) self.length 1 def pop(self) if self.empty): return None self.length1 return self.items .pop) dlef size (self) return self.length def peek(self) if self.empty): return None return self.items [0] def empty(self) return self. length = 0 def tr (self) return str (self.items) precedence precedence [ ' * ' ] = 3 precedence-3 precedenceI'+'-2 precedence--2 precedence''] - 1 def convert (expression) print(__convert (expression.split O)) dlef convert (tokens): postfix -[1 opstack-Stack ) or token in tokens if token.isidentifier: postfix.append (token) opstack.push (token) while True: elif tokenC': elif token'': tempopstack pop) if temp is None or temp' brea elif not temp.isidentifier postfix.append (temp) else: # must be operator if not opstack.empty): temp opstack.peek) while not opstack .empty() and precedence [temp] precedence [token] and token. isidentifier(): >= postfix.append (opstack po) temp opstack.peek (0 opstack-push (token) while not opstack.empty) postfix.append (opstack pop O) return postfix s input ( 'Enter Infix expression : convert (s) ' )