Using the Bottom Up LR(1) Parsing algorithm, parse the following input string: yx$ Below is the Parsing Table and Grammar. This is the same table and grammar we went over in class, but for a different input string. To provide your answer, use the following three columns in the following format, where the top of the stack is to the left. [stack] [input] [action] I recommend creating a three column table in Canvas with stack, input, and action as column headers (although not required). Parsing Table Grammar (1)E EB (2)E E+B (3) EB (4)B Bx (5) By Sn - shift, the next state is n rm-reduce, indicates that a reduction with grammar rule m should be performed aC - accept, indicates that the parser accepts the string in the input stream er- indicates error