You are given a string text.
Return a bool that is True if text is a pangram — that is, it contains every letter of the English alphabet (a through z) at least once — and False otherwise.
The check is case-insensitive: uppercase and lowercase forms of a letter both count. Non-letter characters (spaces, digits, punctuation) are simply ignored.
NOTE: This is a function-type question — you only write the function. Do not read input or print anything; a hidden checker calls your function and checks its return value.
Arguments
'The quick brown fox jumps over the lazy dog'
Returns
True