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 circularstring, so it has no beginning or ending position. You could break T at eachcharacter and solve the linear matching problem|T|times, but that wouldbe very inefficient. Show how to solve the problem by only one use of thestring matching algorithm.