Apply the power$-$set construction as stated in lectures to the following NFSM$.$ Write down the

result of each step, and then draw the final machine. Convince yourself that resulting DFSM

accepts the same set of strings as the original NFSM $($no need to write anything for this, just

try a few strings out$).$ Is there an easy, obvious way that the final result could be simplified?