6.2. (8 points) Consider the following context free grammar. It can be used to generate strings that are specific permutations of a famous movie quote. brick is the start symbol. brick- I love unit | unit love lamp | lamp love I unit - 1 | lamp This grammar is ambiguous. Demonstrate why this grammar is ambiguous. because it's not divided into digit by digit to be sorted6.1. (6 points) Consider the following context free grammar. It can be used to generate strings of unsigned integers. str is the start symbol. str - | ints - ds | ds , ints ds - d{d } d - 0|1 |2 | 3 | 4 | 5 | 6 | 7|8|9 Provide an implementation of a function called parsestr that parses the str symbol shown in the grammar above. You can assume that there already exist functions called parseInts, parseDs, and parsed that you may call. / * * * Parses a str and returns the integer value * . .. @requires [a str string is a proper prefix of ts] * Censures parsestr = [value of longest str string at start of #ts] and #ts = [longest str string at start of #ts] * ts public static int parseStr (Queue ts) {