Convert the NFA to DFA. Implement the DFA using C# or Java. The input of the DFA is a string and output is “accepted" "rejected". DFA accepts or rejects a string when it reads the final symbol in the string.

Recognizing strings based on a set of restrictions is a common computational problem. A Slop is a string of characters that has certain properties. Your program will read in strings of characters and output whether or not they are Slops. A Slip is a character string that has the following properties: Its first character is either a 'D' or an 'E' The first character is followed by a string of one or more 'F's The string of one or more 'F's is followed by either a Slip or a 'G' The Slip or 'G' that follows the F's ends the Slip. For example, DFFEFFFG is a Slip since it has a 'D' for its first character, followed by a string of two F's, and ended by the Slip 'EFFFG' Nothing else is a Slip A Slap is a character string that has the following properties: Its first character is an 'A' If it is a two-character Slap then its second and last character is an 'H' If it is not a two-character Slap, then it is in one of these two forms: 'A' followed by 'B' followed by a Slap, followed by a 'C'…

36. Write a JAVA program to input two strings from the user and print all the characters present in both strings. If any character is present more than once in both the strings, then print the character again.

Refactor the following code using the concept of functions. a = 2 b = 3 C= 4 d = 5 a = 2 b = 3 C= 4 d = 5