2. Divisibility Of Strings As part of an assignment, a student is required to find whether a given string s is divisible by string t. If it is divisible, the student needs to find the length of the smallest string x such that if x is concatenated any number of times, we get both s and t. If this is not possible, the student needs to print -1. Help find the length of the smallest string x. A string s is said to be divisible by string t if string t can be concatenated some number of times to get string s. Example: s= bcdbcdbcd bcdbcd If string t is concatenated twice, the result is bedbcdbcdbcd > s. String s is not divisible by string t, so the result is -1. Example: s = bcdbcdbcdbcd t = bcdbcd If string t is concatenated twice, the result is bcdbcdbcdbcd = s. String s is divisible by string t. The smallest string x that can be concatenated to create both strings s and t is bcd. Its length is 3. Function Description Complete the function findSmallestDivisor in the editor below. The function should return a single integer denoting the length of smallest string x. findSmallestDivisor has the following parameter(s): s: string s t: string t Constraints • 1s size of s s 2 x 105 • 1s size of ts 2 x105 size oft s size of s

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.