Everything is located in the link provided

CISP 430 Assignment 5 Spring 2018 Stack and Queue Hand Executions Perform several HAND EXECUTIONS of the following stack and queue algorithms. This is not an implementation, which means you do NOT have to write code. Instead, draw lots of nice pretty diagrams. Your diagrams should be suitable for explaining the algorithm to a non- computer scientist "regular person". Part 0 Fully Parentheslzed Infix Evaluation: This algorithm uses two stacks, one for operands, and one for operators. The infix expression must be fully parenthesized for this algorithm to work Use the following infix expressions for your hand execution: Algorithm O: Evaluato Fully Parenthesized Infix Expressions while (c readcharacter) ( if (c is a number) nums.push(c) if (c is an operator) ops.push(c); if (c is a right parenthesis) ( num1 nums.pop): num2 nums.popo: op ops pop) ans num2 op num1; nums.push(ans) if (c is a left parenthesis) do_nothing ans = pop()