https://www.ibm.com/cloud/blog/jvm-vs-jre-vs-jdk

1. Read this interesting article on Java (https://www.ibm.com/cloud/blog/jvm-vs-jre-vs-jdk) and tell us if you think Java is interpreted or compiled and if both, when it is interpreted and when it is compiled. 2. Build a DFA to accept hexadecimal numbers. If a DFA has all its arrows inverted except the 'starting' arrow, would it still be a DFA? 3. Convert the above to an NFA 4. Generate a DFA for a set of strings with a's followed by b's with both the number of a's and b's being equal for the alphabet ={a,b} 5. Generate a DFA for a regular expression defined for the language over an alphabet ={a,b} with only one b. 6. Construct an FA for the regex abaa with only 3 states