Problem 3 (6 points) Perform the pairwise disjointness test for following grammar rules. Show your work. S aSb AA a. b. AaaA | b | aB Problem 4 (4 points) Compare and contrast Compiler-based and Interpreter based languages. List pros and cons. Which one do you prefer. Problem 5 (5 points) Consider the grammar with alphabet a and b that generates all strings with even number of a's: (b*ab*a)*b* i. Give a regular expression to generate all possible strings over alphabet a and b in which the number of "a"s is multiple of four. What are the six smallest strings that can be generated by your expression. 111. Circle the strings generated by your grammar: baaaa, aaaab, abababab, abbbaabba, aa, aaa, aaaaaa