Write a computer program that receives an input of words in the sentence and construct a binary search tree from the collection of words. Consider an alphabetical order relation for for comparing the collection of words. Example Input: "A fool sees not the same tree as a wise man sees." Example Output: A; fool; as; sees; not; man; same; the; tree; wise Visualizaation of the binary search tree. A as fool sees not the man same tree wise