This assignment will also help you to become familiar with the following important content knowledge in this discipline: List Stack Queue Priority Queue Tasks 1. Do exercise question 20.11- Match grouping symbols: 1. A Java program contains various pairs of grouping symbols, such as Parentheses: (), Braces: [], and brackets: []. 2. Note the grouping symbols cannot overlap. For example, (a (b) ] is illegal. 3. Write a program to check whether a Java source-code file has correct pairs of grouping symbols. 2. Do exercise question 20.14- Postfix notation. 1. Postfix notation is a way of writing expressions without using parentheses. For example, the expression (1+2) 3 would be written as 1 2+3*. 2. A variable or constant is pushed into the stack. 3. When an operator is encountered, apply the operator with the top two operands in the stack and replace the two operands with the result. 4. For example 12+3*, 1. Stack: 1 2. Stack: 21 3. Stack: 3 4. Stack: 3 3 5. Stack: 9 6. return 9