1. Rewrite the longest common substring code as a class.
2. Write a program that uses a brute force technique to find the longest common substring. Use the Timing class to compare the brute force method with the dynamic programming method. Use the program from Exercise 1 for your dynamic programming solution.
Exercise 1
Rewrite the longest common substring code as a class.