This assignment will test you over inputting and outputting files character-by-character, while applying appropriate logic. we have a text file that has been written in a bizarre code. the code works like this: the message consists of alphabetic characters that alternate from upper to lower and back to upper case. any other letters that appear in the message that are not in this sequence are "dummy characters" to be discarded. in addition, the message can contain non-alphabetic characters which should be output as is. the upperto-lower-to-upper sequence restarts with each new sentence (that is, after any period, we will assume no other character ends a sentence such as ! or the only upper case letters that should be output in upper case are the first letter of any sentence. all other letters, no matter if they appear in upper or lower case in the input should be output in lower case. consider the following text: abcbcdcccdefghee afafghijkhij jklmklmlmnmno nonoop pqrqqq. abcsuuv abcwxyxxx yyz. start with the ‘a’ which should be output as ‘a’. we next expect a lower case letter