Create a function named countCharRange which takes a string and a range$\_$t structure $($not a pointer$)$

as arguments. The function should search the string and return the number of characters from the

string are in the range given in the structure. Note the range SHOULD include the start and end

characters. This function should be case insensitive in that it should count both $$E$$ and $$e$$ if either is in

the string.

For example, if the string is $"12$eabbmcddEeFf" and the structure$$s start is $$e$$ and its end is $$z$$ your

function should return $6$ since six of the letters from the string $($characters emEeFf$)$ are from $$e$$ to $$z$$

It should return $6$ because the underlined characters are in the given range $"12$eabbmcddEeFf"

The string may contain any valid printable character. It wont just contain alphabetic characters.

You can assume the range$\_$t structure will only contain lowercase alphabetic characters.