Maximum Product of the Length of Two Palindromic Subsequences

Given a string s, the task is to find two disjoint palindromic subsequences of s such that the product of their lengths is maximized. Disjoint subsequences mean they do not both pick a character at the same index.

The objective is to determine and print the maximum possible product of the lengths of the two palindromic subsequences.