Given two strings s and t, determine whether s is a subsequence of t. Return TRUE if it is, or FALSE otherwise.

A subsequence of a string is a new string formed by deleting zero or more characters from the original string, without changing the relative order of the remaining characters. For example, "ace" is a subsequence of "abcde", whereas "aec" is not.

Constraints:

• $0 \leq$ s.length $\leq 100$

• $0 \leq$ t.length $\leq 10^4$ ...