Construct a PDA that recognizes the following language: Every prefix contains at least as many a's as b's Hint: To get the maximum number of points, use as few states and nonterminals as possible! • Alphabet: {a, b} • Stack alphabet (the first symbol is the initial one): Z YX apply • Acceptance condition: final state o Deterministic (DPDA): false

in C++

Write a C code for the structure types of a dynamic linked list implementation of a stack. Each node of the stack will have the following members: Name: char type array ID: integer type number Grade: double type number Link: pointer/link to next nodeWrite functions to add and remove the nodes of the stack and use printf() to show that the code is working properly.

In the study of formal languages state-transition diagrams are often usedto visualize changes in a machine’s configuration as it acts on input. To visualize amachine’s configuration think of its parts: Commonly a finite set of states, a finiteinput alphabet Σ, Perhaps storage devices (a stack, input/output tapes). The states arepictured as named circles sometimes decorated with symbols to denote special states,e.g. start and final states. Changes in configuration are denoted by labeled edges andperhaps changes in storage.1. Describe how edges are labeled and their meaning for finite state machines.2. Describe how edges are labeled and their meaning for pushdown automata.3. Describe how edges are labeled and their meaning for Turing machines.