Data Structures and Algorithms:

Computer Science Java.

Please show the steps how the answer is obtained and justify the reasoning.

What is the cost function for the following algorithm? input: S[n], T[k] // String of length n and token of length k output: location of T in S, or -1 for i = 0 ... n - k for j = 0 ...k if S[i + j] != T[j] break if j == k return Page 1 return -1 6kn - 6^2 + 4n - 4+1 6kn-6n^2 + 4n - 4+1 6n^2 - 6^2 + 4n - 4k +1 O on^2 + 4n + 1