Complexity of the question

Sir you have mentioned in this video that complexity will be O(2^[s1.length+s2.length]) but I think the complexity of the solution will be O(3^[s1.length+s2.length]).
If I am wrong then please correct me.

@shivank.agg.sa Deeply regret the mistake the complexity will be O(3^[s1.length+s2.length]) bcoz 3 recursive calls has been made.