Automata Languages and Computation (COMP 20042) -Fall 2022- CW2(Assignment) - All - QP Task 3 : [25 Marks] NP-complete problem is a class of computational problems for which no efficient solution algorithm has been found. Many significant computer-science problems belongs to this class. With reference to at least two publications, explain any one application of the NP.Complete problem. Your explanation should have: Introduction of the problem Justification of why the chosen problem is in NP-complete :5 Marks. Critical analysis on the implementation of NP-complete problem on any one real time applications Citations/references : 10 Marks Automata Theory is an exciting, theoretical branch of computer science. Automatons are abstract models of machines that perform computations on input by moving through a series of states or configurations. The major objective of automata theory is to develop methods by which computer scientists can describe and analyze the dynamic behavior of the discrete system. Automata are widely used for the verification of software, distributed systems, real-time systems, and queue management systems. Read the research article "Automata Theory Approach for Nurse Rostering Problem" and explain the different constraints laid down for the implementation of different automata methods used to model the roster system. [The explanation should have the various conditions considered for the implementation of rostering the nurses] (Please note that the explanation should not reproduce the given statements, rather a critical reflection is expected. Students can also refer to any other resources which are relevant)