You are given two strings a and b consisting of lowercase English letters. Let a' be the concatenation of 10250 a coples. Find the minimum integer / such that b is a subsequence of the string a'ja'a'3...a,' (the first i characters in a') Constraints 1slal $105 1s (bl s105 . . a and b consists of lowercase English letters. Example: Input contest son Output 10 contest sun Output -1 b= sun is not a substring of a' = contestcontestcontest.... Thus, there is no integer i satisfying the condition. Input Input is given in the following format: Output If there exists an minimum integer i satisfying the following condition, print i; otherwise, print -1 [execution time limit] 1 seconds (cpp) [input] string a . [input] string b . . . [output] integer64 4 Input Input is given in the following format: b Output If there exists an minimum integer i satisfying the following condition, print i; otherwise, print -1 [execution time limit] 1 seconds (cpp) [input] string a . . . . [input] string b [output] integer64 [C++] Syntax Tips // Prints help message to the console // Returns a string string helloworld(string name) { cout < < "this prints to the console when yo return "Hello," name;