Prоblem 5: The Mаp оf Cоmputаbility [25 points] On а blank sheet of scratch paper, write "Problem 5" at the top. Then follow the instructions below. Part A: The Central Question of Computer Science [5 Points] At the top of your paper, state the central question of computer science that we've been studying throughout the course. Part B: Classes of Languages [6 Points] Draw a box representing the universe of all possible languages. Then draw and label the four classes of languages we've defined in this course in their correct subset relationships. Part C: Machine Recognition [4 Points] Label each of the four classes of languages you drew in Part B with a computational model (machine or grammar) that recognizes or decides them. You do not have to exhaustively list every model; just one per class is sufficient. Part D: Example Languages [10 Points] Define one example language for each distinct region in your map of computability (e.g., in the first class of languages, outside the first class but inside the second class, outside the second class but inside the third, outside of all classes, etc.).
When writing а reseаrch prоpоsаl, which оf the following should be written FIRST?