Create a NDFA interpreter program in Clojure that is something like the image below Test your solution for representing the NDFA that accepts strings like ab* c.

Write a program in Java to count the total number of vowels and consonants in a String. The string can contain all the alphanumeric and other special characters as well. However, only the lowercase English alphabets are allowed in the String.

Write a program in C++ which allows the user to input 3 sets (A,B,C) and to display the cartesian product AxBxC of the 3 sets, and then calculate the number of elements in AxBxC. Keep in mind, if the the input looks like A={a,b,c}, B={1,2,3,4}, C={A,B,C,D,E}, the output should look like “AxBxC = {(a,1,A), … ,(c,4,E)} and it has 60 elements”