Q2: Consider an FSM with 4 states encoded as {00,01,10,11} and initial state 00. Let the formula shown below relate an unconstrained state of the system (sn-1) to a specific value of the next state (sn) that can be reached from it. (sn = 01) ^ (sn Ed(sn-1)) * If the formula can be satisfied by some value of sn and sn-1, would that finding conclusively indicate anything about the reachability of state 01 (in an unbounded number of steps) from the initial state? Justify your answer. If the formula is unsatisfiable, would that conclusively indicate anything about reachability of 01 from the initial state? Justify your answer. Q2: Consider an FSM with 4 states encoded as {00,01,10,11} and initial state 00. Let the formula shown below relate an unconstrained state of the system (sn-1) to a specific value of the next state (sn) that can be reached from it. (sn = 01) ^ (sn Ed(sn-1)) * If the formula can be satisfied by some value of sn and sn-1, would that finding conclusively indicate anything about the reachability of state 01 (in an unbounded number of steps) from the initial state? Justify your answer. If the formula is unsatisfiable, would that conclusively indicate anything about reachability of 01 from the initial state? Justify your