Given two strings s and t. Find the maximum number of times that one can recursively remove t from s.\n\n**Example 1:**\n```\nInput: s = "aabcbc", t = "abc"\nOutput: 2\nExplanation: We can first remove s[1:3] and s becomes "abc". We can then remove it all.\n```\n\n**Example 2:**\n```\nInput: s = "abababaaba", t = "ababa"\nOutput: 2\n```

Given two strings s and t. Find the maximum number of times that one can recursively remove t from s.\n\nExample 1:\n\nInput: s = "aabcbc", t = "abc"\nOutput: 2