software testing

PLEASE I NEED CFG ((HAND written ))

Q2: Solve the following problem: The following source code returns the longest substring that appears at both the beginning and end of the string without overlapping. For example: sameEnds("abXab") returns "ab". 01 public String sameEnds (String string) | int len = string.length(); String fin =" "; String tmp =" "; for (int i=0; i