Suppose you have a string matching algorithm that can take in (linear) strings S and T and determine if S is a substring (contiguous) of T. However, you want to use it in the situation where S is a linear string but T is a circular string, so it has no beginning or ending position. You could break T at each character and solve the linear matching problem |T| times, but that would be very inefficient. Show how to solve the problem by only one use of the string matching algorithm. This has a very simple, cute, solution when you see it.