We will call a word palindrome if it is symmetric. For example, "ababa" and "abcba" are palindromes and "abcde" is not. Design a recursive algorithm that finds all the ways to cut a given word into palindromes of length more than one. For example, "aabbaabbaa" can be cut as "aa" + "bb" + "aa" + "bb + "aa", "aa" + "bbaabb" + "aa", and just "aabbaabbaa", "aabbb" can be only cut as "aa" + "bbb