This is the attached file for our programming assignment, but I don't know what it is asking me to do or what needs to be done. Any help on the matter would be great. Thanks.

COSC 3302 Programming Assignment 1 (Lectures 1, 2, and 3) 1. (Membership problem for a DFA). Input: A (deterministic finite automaton is a 5-tuple M 3(Q, S, qo, A, 6), where Qis a finite set of states, is a finite input alphabet, qo E Q is the initial state, Ag Q is the set of accepting states, and Q x Qis the transition function. Note: From state q the machine will move to state o(q, o) if it receives input symbol o. In other words, the destination state is unique -hence FA is deterministic (DFA). Example: Graph of a DFA Accepts all strings without two consecutive 1 0,1 Start Previous Previous Consecutive string ok, string oK, 1's have does not ends in a been seen end in 1 single 1 Alternative Representation: Transition Table Final states Columns starred 0 1 input symbols A A B Arrow for B A C start state C C C Rows states. The notation (a, x) describes the state the FA is in after starting in state qand receiving input string x. The extended transition function Q x Q is defined recursively as follows: For every q e Q, (q, A) q For every q e Q, every y E y and every o E S, o*(q, yo) J (q, y), o). This just says that if you already know how to process the string y, then to process one additional symbol o, you use the ordinary transition function starting from the state (a, y)