I. Problem sets for chapter 4 1) Perform the pairwise disjointness test for the following grammar rules C aCbl bAA A bfaBl a B aB| a 2) Given the following grammar and the right sentential form, draw a pares tree and show the phrase, simple phrase, and handle C aAbl bBA A aABI ab B aB| b right sentential form: bBab 3) Show a complete parse tree, including the parse stack, input string and action for the string (id*id) tid using the grammar and parse table in section 4.5.3