What are the Boolean equations for the next state of this Diagram?

Do the following

Create the thruth table for the given Statement diagram with the given encoding of each state. Use the following labels input: $q,$ outpute, cument state: $c,$ next state: $n.$

Derive the boolean equation $($s$)$ for the next state from the truth table. This Boolean is equation is the answer to the question.

Note: use the given labers!

$\backslash$table$[[$State$,\backslash$table$[[$Eacode$],[$Binm value$],[(c1,c0)$