PDAs and Turing Machines

      1. Construct a PDA in JFLAP (version 7.1) that recognizes each of the following languages. For each language, you must submit one JFLAP file clearly labelled (e.g., 1a.jff). Make sure that you test your PDAs in JFLAP before submitting. a. 𝑨 = {𝐚𝒊𝐛𝒋𝐜𝒌 | 𝒊, 𝒋, 𝒌 𝟎 𝐚𝐧𝐝 𝒌 = 𝒊 + 𝒋} b. 𝑩 | 𝒘 = 𝒘𝑹} c. 𝑪 = {𝒙𝒄𝒏 | 𝒙 𝟎, 𝐚𝐧𝐝 𝒙 𝐡𝐚𝐬 𝒏 𝐚’𝐬 𝐨𝐫 𝒏 𝐛’𝐬} Hint: 𝐶 is the union of two simpler context-free languages