Please complete the missing programs in place says Complete. Bold or highlight your work, add comments and show the outputs.

/ CSIT 212 Data Structures and Algorithn Stack Application Assignnent This Java Program checks for batanced parentheses in an expression using stack. ./ /* This interactive progra allows a user to enter various parenthesized expressions e which are then checked for correctly matched and balanced parentheses Author: H. A. Johnson BatancedParentheses. java package nyprest mport AyproiectStask mport java.utit.scanner: public class BalancedParentheses ( Stack s-new Stack):l String para0penedI1(" String paraclosedti"] boolean pairkith(String x) ( if (s.top().equals(")&x.equals("1") } else if (s.top( ).equals("(") && .equals(")")) { } else if (s.top ( ) .equals("(") x.equals(.)")) { return false; return true; return true: return true boolean tscounterpart(string x) for (inti 0:i