Is the following BNF grammar ambiguous? Assume the start symbol is . If it is ambiguous, give an example input and draw different parse trees for it; also, formulate an unambiguous grammar that is equivalent. -> | -> 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9