Given the following grammar: sentence - left a right b left - left b | b right - a right | a Indicate which of the following strings...

Given the following grammar:<sentence> -> <left> a <right> b<left> -> <left> b | b<right> -> a <right> | aIndicate which of the following strings are valid according to this grammar. For those that are valid, construct the parse tree.baabbbbaaaaabbbbabaababbbbaaabbIn English, describe the strings generated by this grammar as specifically as possible.