Lab 8 String matching. Build a finite automaton of the following patterns and find all valid shifts with which the given patterns occur in three given texts Your task ns three parts: 1. Build one non-deterministic/deterministic finite automaton for the patterns 2. Implement the parsing application and print out the count that each pattern occurs 3. Finish the document, in which you should explain each part of your application in detail You must finish this task individually. Any cheating will be marked ZERO Enjoy it and Good Luck! Given patterns “中华人民共和国” “中华人民共和国国家发展和改革委员会” 亚洲开发银行” “国际货币基金组织” 中国人民银行” Gradi (1)Algorithm and implemented code(60%) (2)Efficiency of the algorithm(20%) (3)Document(20%)Lab 8 String Matching. Build a finite automaton of the following patterns and find all valid shifts with which the given patterns occur in three given texts. Your task contains three parts: 1. Build one non-deterministic/deterministic finite automaton for the patterns. 2. Implement the parsing application and print out the count that each pattern occurs. 3. Finish the document, in which you should explain each part of your application in detail. You must finish this task individually. Any cheating will be marked ZERO. Enjoy it and Good Luck!! Given patterns: “中华人民共和国” “中华人民共和国国家发展和改革委员会” “亚洲开发银行” “国际货币基金组织” “中国人民银行” Grading (1) Algorithm and implemented code (60%). (2) Efficiency of the algorithm (20%). (3) Document (20%)