19. Consider the following grammar and LR parse table, and the current stack-content and input string to be processed (as we discussed in the class) Figure 4.5 The LR parsing table for an arithmetic expression grammar State id S4 S6 R2 S7 R4 R4 R2 R2 R4 R4 5, F (E) 6. Fid R6 R6 R6 R6 S4 10 R1 R3 R3 RSR5 S11 R1 R3 R3 R1 10 Current Stack Content: OE1+6T97 Current Input:) S The Next stack-content and input-string will be A. Stack: OE1+6T9 Input:) S B. Stack: OE1+6T9*7F10 Input:) S C. Stack: 0E1+6T9*7(4 Input: S D. Stack: OE1+6T9 Input: S E. None of the above