String Transformation

Problem Statement

String Transformation Problem Description Given two strings S and T consisting of N and M characters, respectively, determine 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 indicating the operation performed, or "EQUAL" if no operation is needed, or "IMPOSSIBLE" if none of the operations work. class Solution { public String solution(String S, String T) { // Implement your solution here } } The allowed operations are: "ADD c" : if string T can be obtained from string S by inserting a single character "c" at the beginning of the string. "REPLACE c d" : if string T can be obtained from string S by replacing a single occurrence of character "c" with a single character "d" (these characters should be distinct). "MOVE c" : if string T can be obtained from string S by moving a single occurrence of character "c" to the right in the string (that is, deleting it from some position and reinserting it