Peter has two strings of the same length. The first string is fixed and the second string is rotatable. In the left rotation, the the first character is removed and added to the end of the string. In the right rotation, the last character is removed and added to the start of the string. Peter is interested in knowing the longest common prefix of both the strings. F Write an algorithm to help Peter find the minimum number of rotations required to find the longest common prefix. If no prefix is common then output -1. Input The first line of the input consists of a string firstString, representing the first string. The second line consists of a string secondString, representing the second string. Output Print an integer representing the minimum number of rotations APR 30 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 23 */ public class { 1 public st { } int // Wr retur public sta { Scanne // inp String // inpu String int res System. Question Output Print an integer representing the minimum number of rotations required to find the longest common prefix. If no prefix is common then print -1. Constraint 0 < len; where len is the length of both the strings Note The input strings are alphanumeric. The input strings consists of lowercase and uppercase alphabets (i.e. a-z and A-Z) and digits (i.e. 0-9). The string comparisons are case sensitive i.e abcd and ABCD are not considered same. Example Input: a2abccc bddda2a Output: 2 Explanation: The longest common prefix is a2ab. The minimum number of rotations required to get the longest common prefix is 3 (right rotations) O APR 30 1 2 3 4 5 3 498 6 7 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 import java.util import java.lang import java.io.* /* * firstString, r secondString, rep */ public class Solut { 2 public static { } int answe // Write y return answ public static vo { Scanner in = // input for String first // input for String second int result = r System.out.pri E Question minimum number of rotations required to find the longest common prefix. If no prefix is common then print -1. Constraint 0 < len; where len is the length of both the strings Note The input strings are alphanumeric. The input strings consists of lowercase and uppercase alphabets (i.e. a-z and A-Z) and digits (i.e. 0-9). The string comparisons are case sensitive i.e abcd and ABCD are not considered same. Example Input: a2abccc bddda2a Output: 2 Explanation: The longest common prefix is a2ab. The minimum number of rotations required to get the longest common prefix is 3 (right rotations). APR O 30 2 1 import java.util.* import java.lang.*; import java.io.*; 3 4 5 6 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 /* * firstString, rep secondString, repres */ public class Solutic { public static in { } int answer = // Write your return answer public static void { Scanner in = n // input for f: String firstStr // input for se String secondSt int result = nun System.out.print