The image below shows a fully constructured FA that will accept any language of letters {a b} that has words consisting of the substring 'ab' an even amount of times withint a given word (2,4,6 times, ect) My question is if there is a way to change the FA to only have one final state or if not explain the reason why. I am new to this material and this was an in class example I am trying to better understand. Thank you..