Write a program to implement the algorithm for evaluating postfix expressions that involve only single-digit integers and the integer operations +, -, *, and /.  To trace the action of postfix evaluation, display each token as it is encountered, and display the action of each stack operation.  1. Each digit or operator should be separated by a space, and end with ':' character. 2. You should apply the stack ADT in the program.  3. You may need to use function is digit(int c) in standard header file #include   to check if the token character is a digit or not. 4. To convert the single-digit char c to the represented integer num, a simple method is to assign num by aChar - '0'

Project Overview: This project is for testing the use and understanding of stacks. In this assignment, you will be writing a program that reads in a stream of text and tests for mismatched delimiters. First, you will create a stack class that stores, in each node, a character (char), a line number (int) and a character count (int). This can either be based on a dynamic stack or a static stack from the book, modified according to these requirements. I suggest using a stack of structs that have the char, line number and character count as members, but you can do this separately if you wish.Second, your program should start reading in lines of text from the user. This reading in of lines of text (using getline) should only end when it receives the line “DONE”.While the text is being read, you will use this stack to test for matching “blocks”. That is, the text coming in will have the delimiters to bracket information into blocks, the braces {}, parentheses (), and brackets [ ]. A string…

java /* Practice Stacks and ourVector   Write a java program that creates a stack of integers.   Fill the stack with 30 random numbers between -300 and +300.   A)- With the help of one ourVector Object and an additional stack,   reorganize the numbers in the stack so that numbers smaller than    -100 go to the bottom of the stack, numbers between -100 and +100 in the middle   and numbers larger than +100 in the top (order does not matter)  B)- (a little harder) Solve the same problem using only one ourVector object for help  C)- (harder) Solve the same problem using only one additional stack as a helper   */   public class HWStacks {   public static void main(String[] args) { // TODO Auto-generated method stub   }   }

You are given a mathematical expression in postfix notation (RPN). During the postfix expression evaluation algorithm, enter the value that would be at the bottom of the stack after processing the 6th token on the following input: 372-+ 6 * (Note this is not about expression trees, this is just the stack-based algorithm for evaluating a post fix expression.)