Consider three strings instr1, instr2 and instr3 having only lowercase alphabets. Identity a string outstr, with the smallest possible length such that when strings instr1, outstr and instr2 are concatenated in the same order instr3 becomes a substring of the concatenated string. Print the smallest possible length of (instr1 + outstr - instr2) satisfying the given criteria. Note: The string outstr can also be an empty string Input Format: The first second and third line contain strings instr1instr2 and instr3 respectively. Read the input from the standard input stream. Output Format: Print the smallest possible length of (instr1 + outstr + instr2) satisfying the given criteria. Print the output to the standard output stream You're Explanati CIAR Sample Output Jusuen that when strings instr 1. outstr and instr2 are concatenated in the same order instr3 becomes a substring of the concatenated string. Print the smallest possible length of (instr. outstr - instr2) satisfying the given criteria