I’m working on a computer science multi-part question and need an explanation to help me learn.Suppose you were modifying the Java compiler to include a new encrypteddkeyword that causes Java to store the contents of the specified variable in encrypted form.E.g.,encrypted String password = “hello”;would cause the contents of password to be encrypted.Which of the phases of the Java compiler would need to be modified and why?
2. For each of the following languages give the regular expression that matches the strings inthe language. Note: You can use . to denote “any” character in the alphabet.(a) [5 marks] The language, over the English alphabet, of strings that begin and end withvowels (assume ’y’ is a vowel).(b) [5 marks] The language of strings, over alphabet Σ = {x,y,z}, whose length is divisibleby 5. E.g., xyzyx.(c) [5 marks] The language, over the alphabet of decimal digits, of strings that representintegers divisible by 200. E.g., 13400.(d) [5 marks] The language of strings over the alphabet Σ = {a,b,c} that do not containthe substring ac. E.g., abcab.
3. For each of the following languages, give a DFA (graphical representation) that recognizesthe language.(a) [5 marks] The language of all strings over the alphabet Σ = {x,y,z} that end in eitherxx or yy. E.g., xyzyxzxx.(b) [5 marks] The language of words over the alphabet Σ = {a}, whose length is notdivisible by 4. E.g., aaa.(c) [5 marks] The language, of trinary strings (Σ = {0,1,2}) such that the sum of thedigits is divisible by 3. E.g., 012102.please don’t copy answers from Chegg,thx.
Requirements: explanation
