input: Write a function to sort words in a given string by their length in decreasing alphabetical order. If the given string is empty then return an empty string.
  def sort_words_by_length_and_alphabet(my_string):
      if my_string == "":
          return ""
      words = my_string.split(' ')
      words_with_length = [(len(word), word) for word in words]
      words_with_length.sort(reverse=True, key=lambda x: (x[0], x[1]))
      sorted_string = " ".join([i[1] for i in words_with_length])
      return sorted_string
  
  assert sort_words_by_length_and_alphabet("This is the string which is to be sorted") == "string the which sorted is be to is This"
  assert sort_words_by_length_and_alphabet("I love programming") == "programming love I"
  assert sort_words_by_length_and_alphabet("apple banana cherry") == "banana cherry apple"
  assert sort_words_by_length_and_alphabet("") == ""
  assert sort_words_by_length_and_alphabet("a an apple") == "apple an a"
output: def sort_words_by_length_and_alphabet(my_string):
      if my_string == "":
          return ""
      words = my_string.split(' ')
      words_with_length = [(len(word), word) for word in words]
      words_with_length.sort(reverse=True, key=lambda x: (x[0], x[1]))
      sorted_string = " ".join([i[1] for i in words_with_length])
      return sorted_string