Define computer science java

Run JFLAP by double-clicking on the  file that you downloaded above. Then use  to open the  file that we have given you.In , you will see the following FSM: This deterministic finite-state machine accepts all bit strings whose third bit from the left is a 1, and rejects all other bit strings. In other words, the accepted bit strings must have at least 3 bits, and the third of those bits must be a 1. The problem of accepting bit strings whose third bit is a 1 can be solved using only five states, but the provided FSM uses six. Simplify the FSM so that it uses five states and still works correctly.Make sure that your simplified FSM still accepts inputs like the following:and that it still rejects inputs like the following: