Discrete math -modeling computation

Given the finite state machine: Determine the transition table associated with the given state machine above. Write the simplest phrase structure grammar, G = (V, T, S, P), for the machine in 4(c)(i). Rewrite the grammar you found in 4(c)(ii) in BNF notation. Determine the output for input string 1111, of the finite state machine in 4(c)(i)