Converting context-free grammar to PDA

Hello, this is the question I'm needing answered. I mostly just want to learn the correct processes for converting a grammar to a PDA so the more details you can provide on the steps the better. Thank you!

2. The language L a'ick:i j or j k is generated by the CF grammar G with start state S given below 4. C-E Design a PDA which makes use the grammar G and accepts L. Walk through the steps of the PDA for the input string abbcc 2. The language L a'ick:i j or j k is generated by the CF grammar G with start state S given below 4. C-E Design a PDA which makes use the grammar G and accepts L. Walk through the steps of the PDA for the input string abbcc