Please also post the run file. Thanks.

Write a program that prompts the user to enter two strings and tests whether the second string is a substring of the first string. Suppose the neighboring characters in the string are distinct. (Don't use the indexof method in the string class.) Analyze the time complexity of your algorithm Your algorithm needs to be at least o(n) time SAMPLE RUN 1: Enter a string s1: Welcome to Java Enter a string s2: come matched at index 3 SAMPLE RUN 2 Enter a string s1: kelcome to lava ava Enter a string s2: Java matched at index 11 Class Name: Exercise22 03