3. Use the grammar below to parse each input string given. Your answer should be a parse tree. The first one is done for you. S CBB CSE Bbc a. Input: abcbc s a B B E b Note: The leaves of the tree, in order from left to right, should be the original input. While you do not have to turn in this calculation, you can catch some kinds of errors in your parse tree by checking that it is true, e.g. aebcbc = abcbc = the original input b. Input: aabcbcbcbc C. aabc