this is for a cs 2130 class - SHould be written in java if applicable

CS2130 PROJECT #5: Finite State Machines This project is intended to increase your understanding of languages, regular expressions, and finite state machines. Part A For each of the languages L1, L2, L3, L4 described below: (1) Write a regular expression for the language. (2) Define a finite state machine (FSM) that recognizes words in the language (input alphabet, states, start state, state transition table, and accept states). Include a state digraph for the FSM. LI: For alphabet (a,b), all strings that contain an odd number of a's L2: For alphabet (0,13, all strings of length 3 or less that have more O's than 1's. L3: For alphabet {x.y,z), all strings that contain xyx or zyz L4: For alphabet {p.q,r}, all strings that contain the substring rqr or end with pp. and exactly one b