simple Java

Problem 1 Write a java program that converts an infix expression into an equivalent postfix expression using stack. For this assignment, only consider correct infix notation (ignore invalid expressions) Full steps for converting infix to postfix must be given before start solving the problem (write your algorithm for solving the problem). Sample output: Enter an infix expression (do not use spaces) a+b*c Postfix expression: abc*+ Enter an infix expression (do not use spaces): (atb) *c+ (d-a) Postfix expression: ab+c da-+ Enter an infix expression (do not use spaces) Postfix expression: ABC D +E+ Problem 2 Write a java code to implement a queue using at most two stacks