Remember presentation counts You must follow the submission instructions and also make sure your work is easy to follow with each step having all information needed to draw your conclusions and nothing not needed Your conclusions should be clearly stated at each step Sentence answers should be clear and concise 1 Consider the finite state machine whose next state function and output function are given by V a 81 82 86 82 85 NA 83 84 86 84 83 86 NS NG 84 8 and W 81 YN YN 83 YY 84 85 YN a Apply the minimization process to the above machine as follows Determine P and provide a brief reason why states are in the same block of the partiton Determine the remaining partitions in the process being clear at each step to give com plete information but to not include information that is not needed to make your con clusion for each comparison of states Clearly state why you have terminated the process b Let y be a minimal distinguishing string for s4 and se Without determining y what is and how do you know this e Determine a minimal distinguishing string for 82 and ss Be sure to give reasons for your answer d Determine a minimal distinguishing string for s3 and se Be sure to give reasons for your answer e Draw the state diagram for the original machine with starting state Your diagram should have no crossing arrows f Draw the state diagram for the minimized machine Your diagram should have no crossing arrows