You are given a custome alphabets that could contain alphabets with two characters or three characters in one letter of the alphabets. sort the given strings lexicographicaly based on the custome alphabet.\n\n```\ncustom_alphabet = {"A", "AA", "B", "CC", "D" "DE", "E", "TD", "F", "GAC" "GG", "HA", "II", "J", "KK", "L",  "MM", "N", "O", "P", "PL", "QQ", "R", "SS", "T", "UU", "V", "WW", "X", "YY", "Z"}\n```\n\nthe list you are given to sort cantains strings formulated by the above alphabets.\n\nExample 1:\n```\n\ngiven_list = [ "AAB", "AB"]\n\noutput = ["AB", "AAB"]\n```\n\nin the strings you have to give priority to letters in the alphabets with more characters like if there is `"AA" `in the string you should not say it is formed by two` A`s instead consider it as one letter as` "AA" `since it exists in the alphabet.\n\nwas able to come up with an` O(M*N) + O(Nlog(N))  `solution where M being the size of the strings and N being the size of the list. And the interviewer seemd to agree on the solution that I proposed and I am waiting for a feedback.

You are given a custome alphabets that could contain alphabets with two characters or three characters in one letter of the alphabets. sort the given strings le