Problem $4,($Revised$)$

Let G be the following grammar.

$SaS|aBB||$

$BaA|b||$

$AaA|a||$

a$.$ Use JFLAP to create an npda M that accepts L$($G$).$ Use the CFG $->$ NPDA algorithm in the instructor slides from Chap $7\mathrm{.}2.$ You must use this algorithm. $($No credit for other algorithms or methods$)$ Submit the JFLAP diagram of M$.$

b$.$ Use JFLAP to test M with the following strings: $a^4,a^5,a^6,$abb,$a^3{b}^3,a^3{b}^2,$ aabaaa, $a^{5}b,$ abaaa, abbabb Submit the JFLAP diagram of the JFLAP test results.

c$.$ Hand draw a parse tree using grammar G for $w=a^{5}b.$ Submit your parse tree.

In the answer for chegg add in the diagram for JFLAP and the drawing of the parse tree must be included in the answer. The parse tree must be hand drawn.