Split Two Strings to Make Palindrome

You are given two strings, a and b. You can split each string into some substrings (possibly none) such that:

Every substring in a is a palindrome. Every substring in b is a palindrome. The number of palindromes formed by concatenating the substrings in a with the substrings in b is maximized. Return the maximum number of palindromes that can be formed.