ending with r’s


(3 points) (5 points) (6 points) Question Five c. Briefly explain the relationship between an activation tree and activation record. int fint n) int t, s Largest Price um of Prices Write out the regular expression for this language: All strings of p's and q's starting and ending with a. List b. Draw the DFA to represent the RE in (a) above C++ to find are going named get pturn total if (n Write out the regular expression for this language: All strings of p's and q's starting and ending with (6 points) (3 points) (5 points) Question Five Largest Price n of Prices Briefly explain the relationship between an activation tree and activation record int fint n) a. List b. Draw the DFA to represent the RE in (a) above C+ to find c. amed get if (n