Problem $1$: Let G be the grammar S $->$ aA $|$ aAA ; A $->$ bAb $|$ bb $.$Use the Exhaustive Search

Parsing algorithm to show that w $=$ abbbbbb in L$($G$).$ You must use the format that illustrates

this algorithm found in the instructor$$s Chap $5\mathrm{.}2$a slides $($ slides $7-11).($No credit for using a

different algorithm or a different format$)$

You must complete the boxes below. Increase the size of the boxes or add extra boxes if needed.

Round $1$

Round $2$

Round $3$

Round $4$