Derive recurrence for Karatsuba splitting into three parts

In the realm of efficient multiplication algorithms, a novel approach has emerged, splitting numbers into three parts to facilitate faster computations. This innovative method, dubbed "TripleSplit," has the potential to revolutionize the way we perform multiplications. The goal is to derive a recurrence relation that governs the time complexity of the TripleSplit algorithm, enabling the analysis of its efficiency and scalability.

Examples
Input: "test_input_1"
Output: "output_1"
Hints

Derive recurrence for Karatsuba splitting into three parts

In the realm of efficient multiplication algorithms, a novel approach has emerged, splitting numbers into three parts to facilitate faster computations. This innovative method, dubbed "TripleSplit," has the potential to revolutionize the way we perform multiplications. The goal is to derive a recurrence relation that governs the time complexity of the TripleSplit algorithm, enabling the analysis of its efficiency and scalability.