3. (15 pts) Suppose you are given a sorted list of words A written in an unfamiliar alphabet with k symbols. Write an algorithm that will output a valid ordering of the alphabet. For example, if your input is then all of the following are
OR
OR
3. (15 pts) Suppose you are given a sorted list of words A written in an unfamiliar alphabet with k symbols. Write an algorithm that will output a valid ordering of the alphabet. For example, if your input is then all of the following are