Write a function: string solution(string &S, string &T): That given two strings S and T, Consisting of N and M characters, Respectively determines whether string T can be obtained from string S by at most one simple operation from the set specified below. The function should return a string: • "INSERT C" o If string T can be obtained from string S by inserting a single character "c" at the beginning of the string. "REMOVE C" o If string T can be obtained from string S by deleting a single character "c" from the end of the string. "SWAP cd" o If string T can be obtained from String S by swapping two adjacent characters "c" and "d" . These characters should be distinct and in the same order as in string S • exactly one swap is performed • "EQUAL" o If no operation is needed • Strings T and S are equal • "IMPOSSIBLE" o If none of the above works Note: characters "c" and "d" from operations above, mean any English alphabet lowercase letters