input: Write a python function that takes a list of strings as input. Each string in the list is a distinct word. The function should return the word that has the highest number of unique characters. In case of a tie, return the word that appears first in alphabetical order.
  assert (find_with_max_unique_chars(["name", "of", "string"]) == "string")
  assert (find_with_max_unique_chars(["name", "enam", "game"]) == "enam")
  assert (find_with_max_unique_chars(["aaaaaaa", "bb", "cc"]) == "aaaaaaa")
  assert (find_with_max_unique_chars(["abc", "cba"]) == "abc")
  assert (find_with_max_unique_chars(["play", "this", "game", "of","footbott"]) == "footbott")
  assert (find_with_max_unique_chars(["we", "are", "gonna", "rock"]) == "gonna")
  assert (find_with_max_unique_chars(["we", "are", "a", "mad", "nation"]) == "nation")
  assert (find_with_max_unique_chars(["this", "is", "a", "prrk"]) == "this")
  assert (find_with_max_unique_chars(["b"]) == "b")
  assert (find_with_max_unique_chars(["play", "play", "play"]) == "play")
output: def find_with_max_unique_chars(words):
      words.sort()
      return max(words, key=lambda word: len(set(word)))