Write a program that checks if a word supplied as the argument is an Isogram. An Isogram is a word in which no letter occurs more than once. Create a function called is_isogram that takes one argument, a word to test if it's an isogram. This method should return a tuple/list/array of the word and a boolean indicating whether it is an isogram. If the argument supplied is an empty string, return the argument and False, ie (argument, False). If the argument supplied is not a string, raise a TypeError with the message 'Argument should be a string'.
The challenge here is to write three unique solutions, using whichever language you like. However, you must maintain the specified identifiers and error messages in the question and use the least possible number of characters to solve the problem. White space will be ignored for readability's sake.
