a$)$ Programmers often use compilers and interpreters to aid them in their daily work. Compare and contrast Compilers and Interpreters.

$\backslash$table$[[\backslash$table$[[$Major Topic$],[$Introduction & Phases of a$]],\backslash$table$[[$Slooms Designation$],[$EV$]],\backslash$table$[[$Score$],[6]]],[$Compiler$,,]]$

b$).$ Consider the following noncontracting Context Sensitive Grammar $($CSG$),$ grammar with start symbol S:

$Sabc$

$S$aSBc

$c{B}_{B}BcBc$

$B{B}_{*}bb$

Show that the above grammar generates the language $L=\{a^{**}{b}^n{c}^n|n>0\}$

$\backslash$table$[[\backslash$table$[[$Majoe Iapi$],[$Context$-$Sensitive Girammars$]],\backslash$table$[[$Hilowens$],[$Braignation$]],$Srove$]]$

c$).$ Computer science, engineering and technology $($CSET$)$ students are often fascinated with the construction of various finite automata. Compare and contrast Deterministic Finite Automata $($DFA$)$ and Nondeterministic Finite Automata $($NFA$).$