input: Write a python function that takes a list of words. The list consists of various strings. The function should return the string with the highest count of unique characters. If there are multiple such strings, return the first one in alphabetical order.
  assert (find_highest_unique(["name", "of", "string"]) == "string")
  assert (find_highest_unique(["name", "enam", "game"]) == "enam")
  assert (find_highest_unique(["aaaaaaa", "bb", "cc"]) == "aaaaaaa")
  assert (find_highest_unique(["abc", "cba"]) == "abc")
  assert (find_highest_unique(["play", "this", "game", "of","footbott"]) == "footbott")
  assert (find_highest_unique(["we", "are", "gonna", "rock"]) == "gonna")
  assert (find_highest_unique(["we", "are", "a", "mad", "nation"]) == "nation")
  assert (find_highest_unique(["this", "is", "a", "prrk"]) == "this")
  assert (find_highest_unique(["b"]) == "b")
  assert (find_highest_unique(["play", "play", "play"]) == "play")
output: def find_highest_unique(words):
      def unique_char_count(word):
          return len(set(word))
      
      max_unique = max(words, key=lambda word: (unique_char_count(word), word))
      return max_unique