write a function called ispangram which returns true if every single lower$-$case letter of the english alphabet is used. every character in the string will be lowercase so you do not need to worry about upper and lower caseisPangram

Write a function called isPangram which returns true if every single

lower$-$cased letter of the English alphabet is used. Every character in

the string will be lowercase so you do not need to worry about upper

and lower case.

isPangran$(snxofblackquartz,$judgenyvow$)$;$\frac{\frac{?}{?}}{}$

true

isPangran$(thequickbroanfoxjumpsoverthelazy$

dog$)$;$\frac{\frac{?}{?}}{t}$rue

$1$sPangran$(thisdoesnothaveallletters)$;$\frac{\frac{?}{?}}{f}$alse

tsPangran$(thiswillnotworkaswell)$;$\frac{\frac{?}{?}}{f}$alse $//**$

Complete the 'ispangran' function below.

The function is expected to return a boolean.

The function accepts string called str as a parameter.

$*/$

function ispangram$($str$)$ f

$>$ function nain$()($ cdots

Raw Format

Enter the raw STDIN input

sphinx of black quartz, judge my vow