Convert the following CFG to an equivalent PDA and show that the PDA accepts the same language by showing the moves of PDA on a sample input; (a + a) + a) as it would simulate the left most derivation of Context Free Grammar

S ASI SC I (S) a A AA I SB B BA AB C BSI CC