Write scanners in LEX format to recognize the following languages over the alphabet ={a,b}. Each scanner must display the number of correct strings and incorrect strings when the corresponding input file is fed (spaces should be ignored). - Strings with even size (input file: aab aabbaa abba baaa) - Strings of odd size (input file: aab aabbaa abba baaa) - Strings that start with a and end with b (input file: aab aabbaa abbb baaa)