Build NFAs for the following two languages. a) The set of strings over alphabet fa, b, c such that the last symbol in the string has appeared before. b) The set of strings over alphabet fa, b, c) such that the last symbol in the string has not appeared before. You can assume that neither of these two languages contain e in them

In this lab, you complete a prewritten c program that calculates an employee’s productivity bonus and prints the employee’s name and bonus. bonuses are calculated based on an employee’s productivity score as shown below. a productivity score is calculated by first dividing an employee’s transactions dollar value by the number of transactions and then dividing the result by the number of shifts worked.