Converting a Context-Free Grammar (CFG) to a Pushdown Automata (PDA) - Theory of Computation

This video explains the steps required to convert a given CFG (Context-free Grammar) to a PDA (Pushdown Automata).
Link for Context-free Grammar: https://www.youtube.com/watch?v=P-j72EYvunU&t=89s
Link for Pushdown Automata: https://www.youtube.com/watch?v=ebl_5PpzmdA&t=66s
Left Derivation: https://www.youtube.com/watch?v=u_d4ylQrsEE&t=14s