Implementing Theory of Computation Algorithms

Hi, I need help on developing a program for Theory of Computation related concepts. This is part of my assignment. Due to other commitments, I was unable to accommodate enough time to complete this assignment, hence I am resorting to you. Below are the particulars of the assignment: *The programs should implement a graphical user interface. Part 1: 1. A Java GUI program that implements Non-Deterministic Finite Automata (NFA) based on the provided alphabets, states, start state, final state, and the transition table. The program should allow the user to input a string and validate whether the string is accepted or rejected by the NFA. Do find the attached illustration of this program. Part 2: 1. A Java GUI program that converts context-free grammar into Chomsky normal form (CNF). a) Input: Context-free grammar, b) Output: Grammar in Chomsky normal form (CNF) (show the steps) 2. Generates the CYK based on the CNF grammar that was produced in 1. Input: String to be parsed Output: The program should show the following output a) Display of the CYK chart (Table) b) A statement to inform user whether the string can/cannot be generated by the grammar I need this project to be delivered as soon as possible. My budget is USD100. I would highly appreciate if you could consider this project and give me a quotation. Specifications: Budget: $100, Delivery time: 7 days (Sep. 16 2019) Programming Language: Java, Operating system: Windows