Given two strings s and t, return True if t is an anagram of s, and False otherwise. Two strings are anagrams if they contain the same characters with the same frequencies, possibly in a different order.
Example 1:
Input: s = "anagram", t = "nagaram"
Output: True
Explanation: Both strings contain the same letters with the same counts.
Example 2:
Input: s = "rat", t = "car"
Output: False
Explanation: The characters differ, so the strings are not anagrams.
1 <= len(s), len(t) <= 5 * 10^4s and t consist of lowercase English letters