Convert this CFG into a PDA. Give precise interpretations for the states and transitions of this machine

A abc| i-jorj-k for i20,j20, k20 The language A can be split into two languages which are defined as follows and Using the language A1 and A2 the user can construct a CFG for , and 2 The grammar for language A is the union of grammar of two languages which is defined as follows In the language the values of i and j are equal so there must be equal number of a's and b's in the language CGF for the language A 1 is as follows: Similarly, in the language 2 the values of j and k are equal so there must be equal number of b's and c's in the language A2 CGF for the language A 2 is as follows