Consider the following grammar to answer the following questions:

X YX |

Y Y1 | 0Y1 | 01

[ 1 point] Give a right-most derivation for the terminal string: 010101.

[ 1 point] Give a left-most derivation for the terminal string: 010101.

[ 1 point] Show that the grammar is ambiguous by exhibiting two distinct derivation trees for some terminal string (hint: use 00111)