Valid Parentheses (10 points)

Given a string s containing just the characters '(',')', '', 'y', 'l' and 'l'. determine if the input string is valid.

. An input string is valid if: Open brackets must be closed by the same type of brackets. Open brackets must be closed in the correct order. Since you have taken the CSCI 335 class, you should know this algorithm pretty well. You don't need to describe this algorithm. What you should do is finishing the following questions:

1). What kind of data structure can you use to solve this problem? (2 points) 2) Show me STEP by STEP of how to use your data structure and al- gorithm to find the answer when s = "010". You can use plain English to describe the process. However, you should not skip the step. (8 points)