Hi, please help me with question below with the change that we "use input abcba for part ii" and part iii should say "Give the CFG" (not the CFL).

Example 3.3.4. Ly = {wew | we [a, b)* }. PDA Me recognizing L3 is shown in Figure 3.12. My uses its $-shielded stack to match the w against the wh, as follows. It pushes won the stack (the end of the substring w being indicated by reaching the c). At this point, the stack content read from the top is we$, so popping down to the $ outputs the string wh. This stack contents is readily compared to the string following the c. The input is recognized exactly if they match. Read a Read b Pop A Pop B PI: P3: A read yzozh read stack empty stack contents $Y Pop $ Push $ or read Read c P4: stack contents $X wowt read stack empty Read a Push A Read b Push B Figure 3.12: PDA M recognizing L3 = {wow" |we (a, b}*}. Z denotes string z in capital letters.i. Modify this PDA so that it meets the requirements given in Section 3.7.1. (Do this carefully.) ii. Draw the trapezoidal diagram for the computation of the modified PDA recognizing input aabb. iii. Give the CFL generated by applying the construction of Section 3.7.1 to the modified PDA.Definition 3.7.1. A leftmost derivation of a string s by a CFG G is a derivation in which the leftmost variable in the currently derived string is always the one to be replaced