Consider the grammar G$2$ that is shown below:

G$2$: ::$=|$

::$=$ cat $|$ dog $|$

::$=$ turtle $|$ snake $|$

Using the grammar given above, answer the following questions:

$(5$ points$)$ Show that the above grammar is ambiguous

For the empty string, even though there are two different productions and parse tree

$(5$ points$)$ Give an unambiguous grammar for the same language generated by the grammar above.