Stacks. Consider the following code:

Please give explainations, thanks.

public static boolean isMatched(String expression) { -"(1["; ")}]"; opening delimiters // respective closing delimiters final String opening final String closing Stack buffer new LinkedStack); for (char c expression.toCharArray)) if (opening,indexOf(c) -1) this is a left delimiter buffer.push(c): else if (closing..ndexOf(c) !=-1) { //this is a right delimiter // nothing to match with // mismatched delimiter //were all opening delimiters matched? if (buffer.isEmpty()) return false; if (closing.indexOf(c) !- opening.indexOf(buffer.pop(0)) return false; return buffer.isEmpty); With the expression as input, write the content of the stack (in order from bottom to top or from left to right) when c = y and when the algorithm terminates