input: Write a python function that takes a list of strings as input. The list contains various words. The function should return the word with the highest count of unique characters. If there are multiple words with the same highest count of unique characters, return the one that appears first in alphabetical order.
  assert (find_word(["name", "of", "string"]) == "string")
  assert (find_word(["name", "enam", "game"]) == "enam")
  assert (find_word(["aaaaaaa", "bb", "cc"]) == "aaaaaaa")
  assert (find_word(["abc", "cba"]) == "abc")
  assert (find_word(["play", "this", "game", "of","footbott"]) == "footbott")
  assert (find_word(["we", "are", "gonna", "rock"]) == "gonna")
  assert (find_word(["we", "are", "a", "mad", "nation"]) == "nation")
  assert (find_word(["this", "is", "a", "prrk"]) == "this")
  assert (find_word(["b"]) == "b")
  assert (find_word(["play", "play", "play"]) == "play")
output: def find_word(words):
      max_unique_count = 0
      result = None
      for word in words:
          unique_count = len(set(word))
          if unique_count > max_unique_count or (unique_count == max_unique_count and (result is None or word < result)):
              max_unique_count = unique_count
              result = word
      return result