1. Using suffix trees, give an algorithm to find a longest common substring shared among three input strings: s_{1} of length n_{1}, s_{2} of length n_{2} and s_{3} of length n_{3}.