<prompt> Kuandika kazi Python kutatua postfix-notation maneno.  <response>: Here is a sample implementation of a python function to solve postfix-notation expressions:def postfix_evalexpression: stack operators : lambda a, b: a b, -: lambda a, b: a - b, : lambda a, b: a b, : lambda a, b: a b for token in expression.split: if token.isdigit: stack.appendinttoken elif token in operators: operand2 stack.pop operand1 stack.pop result operatorstokenoperand1, operand2 stack.appendresult else: raise ValueErrorInvalid character in expression return stack.popThe function first creates an empty stack to store the numbers encountered during evaluation. It also defines a dictionary of operators to define what to do with the operands as they are popped off the stack.It then iterates through each token in the expression, checking whether it is a number or an operator. If it is a number, it is converted to an integer and pushed onto the stack. If it is an operator, the top two elements on the stack are popped, and the operator is applied to them using the appropriate lambda function stored in the operators dictionary. The result is then pushed back onto the stack.If there is an invalid character in the expression, a ValueError is raised. Once all tokens have been processed, the final result is the last element left on the stack, and this is returned. 