Hello, so, one problem os size N is split into 2 problems os size N-1 PLUS a cost of merge partial solutions of N*T(N-2).
So ... do you want a closed form for this recursive complexity time? or do you want to write any algorithm which has this complexity?
Please, let me know. I am expert in algorithm and complexity.... I am professor of this field.
Best Regards!