1. Let \{a,b\}^+ be the set of all finite sequences consisting of the characters 'a' and 'b'. Present an algorithm that takes a sequence of n characters, L, from \{a,b\}^+, where n is odd, as input and determines if L contains a subsequence 'ab' (i.e an 'a' followed immediately by a 'b') by examining at most n-1 characters.