Given 2 strings `a` and `b` with the same length.  Strings are alligned one under the other. We can choose an index and split both strings into 4 subtrings: `a1` + `a2` and `b1` + `b2`. Find out if it\'s possible to split `a` and `b` such that `a1` + `b2` or `a2` + `b1` forms a palindrome.\n\n**Example 1:**\n```\nInput: a = "abcbbbb", b = "xxxbcba"\nOutput: true\nExplanation: \n\nabc|bbbb\nxxx|bcba\n\nWe can split the strings at index 3. We will get a1 = "abc", a2 = "bbbb" and b1 = "xxx", b2 = "bcba"\na1 + b2 forms a palidnrome "abcbcba" so return true.\n```\n\n**Follow-up:**\nNow it\'s allowed to split the strings independently:\n\n```\na|bcbbbb\nxxxbcb|a\n```\n\nSo in the exampe above `a` can be splitted into `a1 = "a"` `a2 = "bcbbbb"` and `b` can be splitted `b1 = "xxxbcb"` `b2 = "a"`. As a result `a1`+ `b2` forms a palindrome `"aa"`. Find the longest palindrome.

Given 2 strings a and b with the same length.  Strings are alligned one under the other. We can choose an index and split both strings into 4 subtrings: a1 + a2