```\nGiven 2  binary strings, your task is to make those 2 strings equal by performing following operation\n-> select any 2 adjacent characters from any string and flip/invert them i.e 0 -> 1 or 1 -> 0\n\nFind the minimum number of operations required to make 2 strings equal.\n\n\nFor example, A = 0101, B = 1111, the optimal approach is \nfirst select middle 2 characters from A and invert them, \nthen, A becomes 0011.\nNow, select first 2 characters from B and invert them, Now, B becomes 0011.\nso, A = B.\nSo, the number of operations required to make A and B equal is 2.\n\n\nCan anyone help me to solve this?\nTHANKS in advance.\n```

\nGiven 2  binary strings, your task is to make those 2 strings equal by performing following operation\n-> select any 2 adjacent characters from any string and