Using only lower case alphabetic characters, how many non$-$empty strings of $4$

characters or less can be formed if the last character of the string must be z and all characters in

string must be unique?