import edu.princeton.cs.algs4.Stack; import edu.princeton.cs.algs4.StdIn; import edu.princeton.cs.algs4.StdOut;

public class Parentheses { // Return true if s has matching parentheses, and false otherwise. private static boolean match(String s) { ... }

// Test client. [DO NOT EDIT] public static void main(String[] args) { StdOut.println(match(StdIn.readAll().trim())); } }

Problem 2. (Matching Parentheses) Implement the static method match) in Parentheses.java that takes a string s as argument and uses a stack to determine whether its parentheses are properly balanced, and returns true if they are and false otherwise. You may assume that s only consists of parentheses (curly, square, and round) $ java Parentheses true $ java Parentheses false