READ CAREFULLY.

Write a file named 'mybitree.rb$\text{'}$ that contains a program that accepts console input, treating alphabetic characters in

groups, separated by whitespace characters as words, and constructs a binary tree, left branch members being lexically

before the root of the tree, right branch members being lexically after the root, repetitions being discarded. Your code

must discard printable strings containing non$-$alphabetic characters but recognize the special token $"$#stop" as the

command to stop building the binary tree and output its content in lexical order, after which your program terminates.