input: Write a python function that takes a list of strings and returns the word that has the highest number of unique characters. If there are multiple words with the same number of unique characters, return the one that appears first when sorted alphabetically.
  assert (find_unique_max(["name", "of", "string"]) == "string")
  assert (find_unique_max(["name", "enam", "game"]) == "enam")
  assert (find_unique_max(["aaaaaaa", "bb", "cc"]) == "aaaaaaa")
  assert (find_unique_max(["abc", "cba"]) == "abc")
  assert (find_unique_max(["play", "this", "game", "of","footbott"]) == "footbott")
  assert (find_unique_max(["we", "are", "gonna", "rock"]) == "gonna")
  assert (find_unique_max(["we", "are", "a", "mad", "nation"]) == "nation")
  assert (find_unique_max(["this", "is", "a", "prrk"]) == "this")
  assert (find_unique_max(["b"]) == "b")
  assert (find_unique_max(["play", "play", "play"]) == "play")
output: def find_unique_max(words):
      return max(words, key=lambda word: (len(set(word)), -ord(word[0])))