Please help me with this homework problem, thanks!

2. (10pt] Boolean Expressions Consider the grammar for Boolean expressions GB: GB B + T|F|BAB|BVB-B|(B) where B is the only non-terminal and, and T (true), F (false), V (disjunction), A (conjunction), ((left parenthesis), ) (right parenthesis), and - (negation) are terminals. 1. [5pt] Is the grammar Gb ambiguous or non-ambiguous? If it is ambiguous demonstrate why it is ambiguous. If it is non-ambiguous, explain in 3-4 sentences why do you think it is non-ambiguous. 2. [5pt] Does the grammar GB have a recursive descent predictive parser? For full credit, if the grammar does have a predictive parser, then list all conditions which are satisfied. If the grammar does not have a predictive parser, then list the conditions that fail