Create a function named is$\_$valid$\_$guess that takes in as arguments two strings and returns a Boolean value. The first string passed to the function is the string of valid letters from step $1$ ; the second string is a guess from the user. The function should return True only if the user's guess string contains exactly $10$ unique letters from the valid letters string. This function does NOT check if the user's guess is the correct solution to the puzzle. For example, if the user's guess is TAKEOURSIM or IMAKETOURS, the function returns True; if the user's guess is IMAKE IMAKE, TAKEOUR, TAKEOURSIMM, or TAKEOURSBD, the function returns False.